|
|
A252917
|
|
T(n,k) = Number of (n+2) X (k+2) 0..3 arrays with every consecutive three elements in every row having 2 or 3 distinct values, in every column 1 or 2 distinct values, in every diagonal 2 distinct values, and in every antidiagonal 2 distinct values, and new values 0 upwards introduced in row major order.
|
|
9
|
|
|
754, 8151, 5125, 90512, 52962, 35674, 1012633, 566649, 418853, 258746, 11398109, 6175841, 5247300, 3590945, 1877439, 128428125, 68396118, 67554413, 54457598, 31484714, 13648650, 1448958659, 754814607, 904486202, 899378367, 606913688
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Table starts
........754........8151.......90512......1012633.....11398109....128428125
.......5125.......52962......566649......6175841.....68396118....754814607
......35674......418853.....5247300.....67554413....904486202..12006682353
.....258746.....3590945....54457598....899378367..16084394412.280079543014
....1877439....31484714...606913688..13412317102.332404559794
...13648650...273765237..6778023822.202527530051
...99324229..2405660944.76682086492
..722975673.21164695786
.5263920930
|
|
LINKS
|
|
|
FORMULA
|
Empirical for column k:
k=1: [linear recurrence of order 64] for n > 65.
Empirical for row n:
n=1: [linear recurrence of order 40] for n > 41.
|
|
EXAMPLE
|
Some solutions for n=2, k=4
..0..1..0..0..2..1....0..1..1..2..0..0....0..1..1..0..2..3....0..0..1..2..2..1
..0..1..0..1..0..2....0..1..1..0..1..0....0..1..1..0..0..3....0..0..2..1..2..3
..0..1..1..0..0..2....0..1..1..0..1..2....0..1..0..3..0..2....0..0..1..2..3..1
..0..0..1..0..3..0....0..1..0..0..1..0....0..1..0..0..3..3....0..2..1..1..3..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|