OFFSET
1,1
COMMENTS
Column 4 of A301823.
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..210
FORMULA
Empirical: a(n) = 6*a(n-1) - 13*a(n-2) + 13*a(n-3) - 6*a(n-4) + a(n-5).
From Reda Belaiche, May 08 2026: (Start)
a(n) = 5*Fibonacci(2*n-1) + n*(n-1)/2 - 3.
The above recurrence follows from the closed form: Fibonacci(2*n-1) satisfies x^2 - 3*x + 1 = 0 and n*(n-1)/2 satisfies (x-1)^3 = 0, giving minimal polynomial x^5 - 6*x^4 + 13*x^3 - 13*x^2 + 6*x - 1. (End)
EXAMPLE
Some solutions for n=5
..0..0..1..1. .0..0..1..1. .0..0..1..1. .0..0..1..1. .0..0..1..1
..1..1..0..0. .0..1..0..0. .0..1..0..1. .0..0..0..0. .0..0..1..1
..0..0..1..1. .1..0..1..1. .1..0..1..0. .1..1..0..1. .0..0..1..0
..1..1..0..1. .0..1..0..0. .0..1..0..1. .1..0..1..1. .1..1..0..1
..0..0..1..1. .1..0..1..1. .1..0..1..1. .0..0..0..0. .0..0..1..1
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Mar 27 2018
STATUS
approved
