A269211 Number of nX5 0..3 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling three exactly once.
432, 49536, 4744704, 394072704, 30541426560, 2267772823680, 163535201141376, 11544796423498368, 801929439109544064, 54999867607734747264, 3733606080456064161408, 251316480848067823807104
Offset: 1
Keywords
Examples
Some solutions for n=2 ..1..0..0..0..2. .1..3..1..3..0. .0..1..0..1..1. .1..3..0..2..3 ..2..0..0..2..3. .1..0..1..1..3. .3..2..3..0..1. .3..1..3..2..2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A269214.
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