|
|
A266098
|
|
Number of nX5 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.
|
|
1
|
|
|
9, 100, 736, 6307, 53442, 457738, 3899732, 33335734, 284461696, 2429715557, 20742789506, 177131531358, 1512387248385, 12914053828252, 110266892304637, 941535315103858, 8039395936919182, 68645593300515776, 586139023034958513
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Column 5 of A266101.
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
FORMULA
|
Empirical: a(n) = a(n-1) +74*a(n-2) +76*a(n-3) -1329*a(n-4) -1483*a(n-5) +10492*a(n-6) +9562*a(n-7) -37686*a(n-8) -32576*a(n-9) +49666*a(n-10) +84934*a(n-11) -16375*a(n-12) -90227*a(n-13) -34968*a(n-14) +34720*a(n-15) +23431*a(n-16) +2409*a(n-17) for n>20
|
|
EXAMPLE
|
Some solutions for n=4
..1..0..1..2..1....0..0..0..1..2....0..0..1..1..0....0..0..0..1..2
..0..1..2..0..1....1..2..2..1..2....0..1..1..0..0....1..1..1..1..2
..2..1..0..1..2....1..0..0..1..1....2..1..2..1..2....1..0..0..1..1
..1..0..1..1..0....1..1..2..0..1....0..0..1..1..0....1..1..1..0..1
|
|
CROSSREFS
|
Cf. A266101.
Sequence in context: A132544 A017018 A027769 * A065736 A092936 A056002
Adjacent sequences: A266095 A266096 A266097 * A266099 A266100 A266101
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
R. H. Hardin, Dec 21 2015
|
|
STATUS
|
approved
|
|
|
|