cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A005253 Number of binary words of length n in which the ones occur only in blocks of length at least 4.

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 7, 11, 16, 23, 34, 52, 81, 126, 194, 296, 450, 685, 1046, 1601, 2452, 3753, 5739, 8771, 13404, 20489, 31327, 47904, 73252, 112004, 171245, 261813, 400285, 612009, 935737, 1430710, 2187496, 3344567, 5113647, 7818464, 11953991, 18277014, 27944604
Offset: 0

Views

Author

Keywords

Examples

			a(6)=7 because 7 binary words of length 6 in which the ones occur only in blocks of length at least 4: 000000, 001111, 011110, 011111, 111100, 111110, 111111. - _Jinyuan Wang_, Jan 20 2025
		

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Programs

  • Mathematica
    LinearRecurrence[{2,-1,0,0,1},{1,1,1,1,2},50] (* Harvey P. Dale, Mar 14 2018 *)

Formula

G.f.: (1-x+x^4)/(1-2x+x^2-x^5). - Simon Plouffe in his 1992 dissertation.
a(n-1) = Sum_{k=0..floor(n/5)} binomial(n-3k, 2k). - Paul Barry, Sep 16 2004

Extensions

More terms from Harvey P. Dale, Mar 14 2018
Name clarified by Jinyuan Wang, Jan 20 2025