OFFSET
1,1
COMMENTS
Diagonal of A206267.
LINKS
R. H. Hardin and Vincenzo Librandi, Table of n, a(n) for n = 1..1000 (first 69 terms from R. H. Hardin).
FORMULA
Recurrence (for n>3): (n+1)*(3*n-2)*a(n) = (15*n^2-n-4)*a(n-1) - 2*(2*n-1)*(3*n+1)*a(n-2). - Vaclav Kotesovec, Oct 19 2012
a(n) = 8+2*C(2*n+1,n), for n>1. - Vaclav Kotesovec, Oct 28 2012
EXAMPLE
Some solutions for n=4
..1..1..0..0..0....0..1..0..1..0....1..1..1..1..0....1..1..0..0..0
..1..0..0..0..0....1..0..1..0..1....0..0..0..0..0....1..0..0..0..0
..0..0..0..0..0....0..1..0..1..0....0..0..0..0..0....1..0..0..0..0
..0..0..0..0..0....1..0..1..0..1....0..0..0..0..0....0..0..0..0..0
..0..0..0..0..0....0..1..0..1..0....0..0..0..0..0....0..0..0..0..0
MATHEMATICA
Flatten[{16, Table[8+2*Binomial[2*n+1, n], {n, 2, 20}]}] (* Vaclav Kotesovec, Oct 28 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 05 2012
STATUS
approved