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.

A001415 Number of ways of folding a 2 X n strip of stamps.

Original entry on oeis.org

1, 2, 8, 60, 320, 1980, 10512, 60788, 320896, 1787904, 9381840, 51081844, 266680992, 1429703548, 7432424160, 39409195740, 204150606976, 1073644675448, 5545305620064, 28980175671212, 149302889205120
Offset: 0

Views

Author

Keywords

Comments

a(n), called G(n,2), is known to be divisible by 4n for n >= 2. - Fred Lunnon, Dec 08 2013

References

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

Extensions

a(12)-a(18) from Fred Lunnon, Dec 08 2013
a(19)-a(20) from Hunter Hogan, Mar 21 2025