|
| |
|
|
A262335
|
|
Number of (n+3)X(3+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.
|
|
1
|
|
|
|
8, 64, 512, 3375, 24389, 185193, 1481544, 11852352, 94818816, 756058031, 6038510661, 48268303721, 386146429768, 3089171438144, 24713371505152, 197696790931375, 1581533604060229, 12652105941015913, 101216847528127304
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Column 3 of A262338.
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..210
|
|
|
FORMULA
|
Empirical: a(n) = 12*a(n-1) -32*a(n-2) -64*a(n-3) +768*a(n-4) -2048*a(n-5) +65*a(n-6) -780*a(n-7) +2080*a(n-8) +4160*a(n-9) -49920*a(n-10) +133120*a(n-11) -64*a(n-12) +768*a(n-13) -2048*a(n-14) -4096*a(n-15) +49152*a(n-16) -131072*a(n-17)
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..1..0..1..1....1..0..1..1..0..1....0..0..1..0..0..1....1..0..0..1..0..0
..0..1..0..0..1..0....1..1..1..1..1..1....0..0..0..0..0..0....0..1..1..0..1..1
..0..0..0..0..0..0....1..1..0..1..1..0....0..1..0..0..1..0....1..0..0..1..0..0
..1..0..1..1..0..1....1..1..1..1..1..1....0..0..1..0..0..1....0..1..1..0..1..1
..0..0..0..0..0..0....1..1..1..1..1..1....0..0..0..0..0..0....0..1..1..0..1..1
..0..1..0..0..1..0....1..1..0..1..1..0....0..1..0..0..1..0....0..0..0..0..0..0
..1..1..0..1..1..0....0..1..0..0..1..0....0..0..0..0..0..0....1..1..1..1..1..1
|
|
|
CROSSREFS
|
Cf. A262338.
Sequence in context: A267730 A189155 A189337 * A221664 A228981 A222388
Adjacent sequences: A262332 A262333 A262334 * A262336 A262337 A262338
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
R. H. Hardin, Sep 18 2015
|
|
|
STATUS
|
approved
|
| |
|
|
