|
|
|
|
| A209905
|
|
Half the number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having two or four distinct clockwise edge differences
(history;
published version)
|
|
|
|
|
#5 by Russ Cox at Sat Mar 31 12:37:30 EDT 2012
|
|
| AUTHOR
|
_R. H. Hardin (rhhardin(AT)att.net) _ Mar 15 2012
|
|
|
|
|
Discussion
|
| Sat Mar 31
| 12:37
| OEIS Server: https://oeis.org/edit/global/875
|
|
|
|
|
|
|
#4 by Ron Hardin at Thu Mar 15 05:29:35 EDT 2012
|
|
|
|
|
|
|
|
#3 by Ron Hardin at Thu Mar 15 05:28:21 EDT 2012
|
|
| NAME
|
allocatedHalf the number of (n+1)X(n+1) 0..3 arrays with every 2X2 subblock having two or four distinct forclockwise Ronedge Hardindifferences
|
|
| DATA
|
62, 13098, 16664508, 135833193008, 6954596004028468, 2253166071062026531552, 4605826850905941430535864352, 59470527831535893681344131012059952
|
|
| OFFSET
|
1,1
|
|
| COMMENTS
|
Diagonal of A209913
|
|
| EXAMPLE
|
Some solutions for n=4
..0..2..2..1..0....3..0..3..3..0....1..0..0..0..0....3..0..0..1..1
..3..3..0..2..3....0..3..0..1..3....3..1..3..1..3....1..3..1..3..0
..0..1..3..3..2....1..0..1..0..1....1..3..1..3..0....0..0..3..1..1
..3..1..0..1..3....1..3..3..2..3....1..0..3..0..1....3..1..0..0..3
..3..0..1..3..1....2..1..0..0..3....0..1..1..0..3....0..3..3..2..2
|
|
| KEYWORD
|
allocated
nonn
|
|
| AUTHOR
|
R. H. Hardin (rhhardin(AT)att.net) Mar 15 2012
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#2 by Ron Hardin at Thu Mar 15 05:26:36 EDT 2012
|
|
| KEYWORD
|
allocating
allocated
|
|
|
|
|
|
|
#1 by Ron Hardin at Thu Mar 15 05:26:36 EDT 2012
|
|
| NAME
|
allocated for Ron Hardin
|
|
| KEYWORD
|
allocating
|
|
| STATUS
|
approved
|
|
|
|
|
|
