|
|
|
|
| A205094
|
|
Number of (n+1)X6 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal and vertical neighbors
(history;
published version)
|
|
|
|
|
#5 by Russ Cox at Sat Mar 31 12:37:05 EDT 2012
|
|
| AUTHOR
|
_R. H. Hardin (rhhardin(AT)att.net) _ Jan 22 2012
|
|
|
|
|
Discussion
|
| Sat Mar 31
| 12:37
| OEIS Server: https://oeis.org/edit/global/875
|
|
|
|
|
|
|
#4 by Ron Hardin at Sun Jan 22 05:04:19 EST 2012
|
|
|
|
|
|
|
|
#3 by Ron Hardin at Sun Jan 22 05:04:15 EST 2012
|
|
| LINKS
|
R. H. Hardin, <a href="/A205094/b205094.txt">Table of n, a(n) for n = 1..210</a>
|
|
|
|
|
|
|
#2 by Ron Hardin at Sun Jan 22 05:03:54 EST 2012
|
|
| NAME
|
allocatedNumber of (n+1)X6 0..3 arrays with the number of rightwards and downwards edge increases in each 2X2 subblock equal to the number in all its horizontal forand Ronvertical Hardinneighbors
|
|
| DATA
|
401164, 33432873, 3475452601, 443278874512, 56016870922512, 7775889911404311, 1006455738823529884, 140049946522756985512, 18181109931832846522455, 2526045976411292472970192, 328545670396985304941543280
|
|
| OFFSET
|
1,1
|
|
| COMMENTS
|
Column 5 of A205097
|
|
| EXAMPLE
|
Some solutions for n=4
..3..2..0..2..2..3....2..2..2..0..0..0....3..3..2..2..3..1....0..1..2..0..3..0
..2..3..1..0..3..0....0..0..0..0..0..0....0..3..3..0..0..1....1..0..2..3..0..3
..1..2..3..1..0..3....0..0..0..0..0..0....0..0..3..1..0..0....1..2..0..2..3..0
..0..1..2..3..1..1....0..0..0..0..0..0....3..0..0..1..1..0....2..0..3..1..2..3
..3..0..1..2..3..2....0..0..0..0..0..0....1..1..0..0..1..1....0..3..1..2..0..1
|
|
| KEYWORD
|
allocated
nonn
|
|
| AUTHOR
|
R. H. Hardin (rhhardin(AT)att.net) Jan 22 2012
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#1 by Ron Hardin at Sun Jan 22 04:57:27 EST 2012
|
|
| NAME
|
allocated for Ron Hardin
|
|
| KEYWORD
|
allocated
|
|
| STATUS
|
approved
|
|
|
|
|
|
