The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A209504 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A209504

Half the number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having two or four distinct clockwise edge differences
(history; published version)

#6 by Russ Cox at Sat Mar 31 12:37:29 EDT 2012

AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Mar 09 2012

Discussion

Sat Mar 31

12:37

OEIS Server: https://oeis.org/edit/global/875

#5 by Ron Hardin at Fri Mar 09 20:27:11 EST 2012

STATUS

editing

approved

#4 by Ron Hardin at Fri Mar 09 20:27:07 EST 2012

LINKS

R. H. Hardin, <a href="/A209504/b209504.txt">Table of n, a(n) for n = 1..13</a>

#3 by Ron Hardin at Fri Mar 09 20:26:45 EST 2012

NAME

allocated for Ron HardinHalf the number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock having two or four distinct clockwise edge differences

DATA

9, 123, 3906, 290493, 50798448, 20934997854, 20362314816594, 46787487624514011, 254139760746795381570, 3264888823627308294556086, 99237696030829285729525930860, 7138720016139671638776178554740514

OFFSET

1,1

COMMENTS

Diagonal of A209511

EXAMPLE

Some solutions for n=4

..1..2..0..2..0....2..0..1..2..0....0..1..0..1..0....0..1..2..0..1

..2..1..2..1..2....0..2..0..1..2....1..2..1..2..1....1..2..0..1..2

..0..2..1..2..1....2..0..1..2..0....2..1..2..1..2....2..1..2..0..1

..1..0..2..1..2....0..2..0..1..2....1..0..1..2..0....1..0..1..2..0

..0..1..0..2..1....1..0..1..2..0....2..1..2..1..2....0..2..0..1..2

KEYWORD

allocated

nonn

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Mar 09 2012

STATUS

approved

editing

#2 by Ron Hardin at Fri Mar 09 20:25:40 EST 2012

KEYWORD

allocating

allocated

#1 by Ron Hardin at Fri Mar 09 20:25:40 EST 2012

NAME

allocated for Ron Hardin

KEYWORD

allocating

STATUS

approved