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.

A195308 a(n) = A005291(n) + A005291(n+1).

Original entry on oeis.org

1, 1, 1, 2, 3, 5, 7, 11, 15, 22, 30, 43, 58, 81, 109, 150, 200, 271, 359, 481, 633, 838, 1095, 1438, 1867, 2430, 3136, 4053, 5200, 6676, 8519, 10871, 13802, 17514, 22129, 27940, 35141, 44155, 55299, 69179, 86286, 107495, 133562, 165744, 205188, 253691, 312975, 385619
Offset: 1

Views

Author

Omar E. Pol, Feb 03 2012

Keywords

Comments

This sequence arises from A005291 in the same way as A000041 arises from A182712.
Observation: a(3)..a(13) coincide with a sequence related to Stirling's numbers from the Jordan's book.

References

  • Charles Jordan, Calculus of finite differences, Chelsea Publishing Co., 1965, chapter IV, pp. 153-155.

Crossrefs

Formula

a(n) = A000041(n-2), 2 <= n <= 11. - Omar E. Pol, Feb 24 2013

Extensions

More terms from Amiram Eldar, May 17 2025