OFFSET
0,2
LINKS
R. H. Hardin, Table of n, a(n) for n=0..500
Shalosh B. Ekhad and Doron Zeilberger, Automatic Solution of Richard Stanley's Amer. Math. Monthly Problem #11610 and ANY Problem of That Type, arXiv preprint arXiv:1112.6207 [math.CO], 2011. See subpages for rigorous derivations of g.f., recurrence, asymptotics for this sequence. [From N. J. A. Sloane, Apr 07 2012]
MATHEMATICA
tup[n_] := Tuples[{0, 1}, n];
cou[lst_List] := Count[lst, {0, 0, 0, 0, 0}] == Count[lst, {0, 0, 0, 0, 1}];
par[lst_List] := Partition[lst, 5, 1];
a[n_] := a[n] = Map[cou, Map[par, tup[n]]] // Boole // Total;
Monitor[Table[a[n], {n, 0, 18}], {n, Table[a[m], {m, 0, n - 1}]}] (* Robert P. P. McKone, Apr 03 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
R. H. Hardin, Aug 11 2009
STATUS
approved