A269198 Number of n X 5 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three no more than once.
756, 68052, 5877228, 463790340, 34838403756, 2532677348772, 179867149105740, 12551707872624132, 864008559706781292, 58827234014669683044, 3969574872302454754188, 265864675607662372035012
Offset: 1
Keywords
Examples
Some solutions for n=2 ..1..0..1..1..1. .0..1..0..2..2. .0..1..1..1..2. .2..0..1..1..0 ..0..0..1..0..0. .3..1..1..0..0. .0..0..0..0..1. .2..3..3..1..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A269201.
Formula
Empirical: a(n) = 156*a(n-1) -8170*a(n-2) +166732*a(n-3) -1381249*a(n-4) +2520764*a(n-5) +23584856*a(n-6) -130579860*a(n-7) +143100280*a(n-8) +633365472*a(n-9) -2425054036*a(n-10) +3486590032*a(n-11) -2082954096*a(n-12) -207585696*a(n-13) +891171072*a(n-14) -335167488*a(n-15) -34112320*a(n-16) +43766784*a(n-17) -8385024*a(n-18) +497664*a(n-19) -9216*a(n-20) for n>21.
Comments