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.

A161709 a(n) = 22*n + 1.

Original entry on oeis.org

1, 23, 45, 67, 89, 111, 133, 155, 177, 199, 221, 243, 265, 287, 309, 331, 353, 375, 397, 419, 441, 463, 485, 507, 529, 551, 573, 595, 617, 639, 661, 683, 705, 727, 749, 771, 793, 815, 837, 859, 881, 903, 925, 947, 969, 991, 1013, 1035, 1057, 1079, 1101, 1123
Offset: 0

Views

Author

Reinhard Zumkeller, Jun 17 2009

Keywords

References

  • Italo Ghersi, Matematica dilettevole e curiosa, p. 139, Hoepli, Milano, 1967. [From Vincenzo Librandi, Dec 02 2009]

Crossrefs

Programs

Formula

From G. C. Greubel, Sep 18 2019: (Start)
a(n) = 2*a(n-1) - a(n-2).
G.f.: (1 + 21*x)/(1-x)^2.
E.g.f.: (1 + 22*x)*exp(x). (End)