Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
editing
approved
R. H. Hardin, <a href="/A280857/b280857.txt">Table of n, a(n) for n = 1..210</a>
allocated for R. H. Hardin
Number of nX6 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards.
82, 1708, 678, 462, 491, 712, 1202, 2268, 4220, 7108, 11240, 17330, 26934, 43062, 70776, 117452, 193842, 316394, 511776, 825074, 1333130, 2163076, 3521462, 5738446, 9343090, 15187700, 24659768, 40027188, 64994524, 105599072, 171639520
1,1
Column 6 of A280859.
Empirical: a(n) = a(n-1) +a(n-2) -a(n-3) +a(n-4) +6*a(n-7) -5*a(n-8) +3*a(n-9) -3*a(n-10) -3*a(n-11) +2*a(n-12) -4*a(n-13) +a(n-14) -2*a(n-15) -2*a(n-16) for n>22
Some solutions for n=4
..0..1..1..2..2..1. .0..1..0..1..1..2. .0..1..0..1..0..1. .0..0..1..2..2..0
..0..2..0..0..1..0. .1..2..0..2..0..0. .2..1..2..1..2..2. .1..2..1..0..1..0
..1..2..1..2..2..0. .0..2..1..2..1..2. .2..0..2..0..0..1. .1..0..2..0..2..1
..1..0..1..0..1..1. .1..0..1..0..1..0. .1..0..1..1..2..2. .2..0..1..1..2..0
Cf. A280859.
allocated
nonn
R. H. Hardin, Jan 09 2017
approved
editing
allocated for R. H. Hardin
allocated
approved