OFFSET
1,1
COMMENTS
Part of the family a(n) = 2*w*(n+2)*C(n+w,w-1) for width-w binary arrays avoiding patterns 001 and 101 (A202195-A202201 for w=3..9). - Christian Krause, Jun 25 2026
LINKS
R. H. Hardin, Table of n, a(n) for n = 1..210
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).
FORMULA
a(n) = (n+8)*(n+7)*(n+6)*(n+5)*(n+4)*(n+3)*(n+2)^2/315. [proved by Christian Krause, Jun 25 2026]
From Colin Barker, May 27 2018: (Start)
G.f.: 16*x*(108 - 492*x + 1218*x^2 - 1890*x^3 + 1932*x^4 - 1308*x^5 + 567*x^6 - 143*x^7 + 16*x^8) / (1 - x)^9.
a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9) for n > 9. (End)
From Amiram Eldar, Jun 28 2026: (Start)
Sum_{n>=1} 1/a(n) = 7*Pi^2/96 - 647/900.
Sum_{n>=1} (-1)^(n+1)/a(n) = 7*Pi^2/192 + 9661/1200 - 182*log(2)/15. (End)
EXAMPLE
Some solutions for n=2:
..1..1..1..1..1..1..1..0....0..1..1..1..1..1..1..1....0..1..1..1..0..0..0..0
..1..1..1..1..1..0..0..0....1..1..1..1..1..1..0..0....1..0..0..0..0..0..0..0
..1..1..1..1..0..0..0..0....0..1..1..1..1..0..0..0....1..0..0..0..0..0..0..0
..0..1..1..0..0..0..0..0....0..1..1..1..0..0..0..0....0..0..0..0..0..0..0..0
MATHEMATICA
a[n_] := (n+8)*(n+7)*(n+6)*(n+5)*(n+4)*(n+3)*(n+2)^2/315; Array[a, 29] (* Amiram Eldar, Jun 28 2026 *)
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
R. H. Hardin, Dec 14 2011
STATUS
approved
