OFFSET
1,1
COMMENTS
Column 5 of A219741
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..69
FORMULA
Empirical: a(n) = a(n-1) +21*a(n-2) +48*a(n-3) +14*a(n-4) -69*a(n-5) -38*a(n-6) +68*a(n-7) +13*a(n-8) -57*a(n-9) +37*a(n-10) -8*a(n-11) -2*a(n-12) +a(n-13) for n>14
Zeilberger's Maple code (see links in A228285) would give a proof that this recurrence is correct. - N. J. A. Sloane, Aug 22 2013
EXAMPLE
Some solutions for n=3
..0..1..0..0..0....0..1..0..0..0....1..0..1..0..0....0..0..1..0..0
..0..0..1..0..0....0..0..0..0..1....0..0..0..0..0....0..0..0..0..1
..1..0..0..1..0....0..1..0..0..0....1..0..1..0..0....0..1..0..0..0
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin Nov 26 2012
STATUS
approved