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.

A007611 a(n) = n! + 2^n.

Original entry on oeis.org

2, 3, 6, 14, 40, 152, 784, 5168, 40576, 363392, 3629824, 39918848, 479005696, 6227028992, 87178307584, 1307674400768, 20922789953536, 355687428227072, 6402373705990144, 121645100409356288, 2432902008177688576
Offset: 0

Views

Author

Keywords

Comments

Answer to the problem A1 proposed during the 51th Putnam Competition in 1990 (see Kedlaya and Larson links). - Bernard Schott, Mar 29 2023

References

  • Ron Larson, Robert P. Hostetler and Bruce H. Edwards, Exercise 135 in Calculus of a Single Variable for Advanced High School Students, Page 605, 8th Edition, 2006.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

Formula

a(n) = (n+4)*a(n-1) - 4*n*a(n-2) + (4*n-8)*a(n-3) with a(0) = 2, a(1) = 3, a(2) = 6. - Dennis S. Kluk (mathemagician(AT)ameritech.net), Feb 12 2006
From Robert Israel, Mar 06 2016: (Start)
a(n) = A000079(n) + A000142(n).
E.g.f.: 1/(1-x) + exp(2x). (End)