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.

A054977 a(0)=2, a(n)=1 for n >= 1.

Original entry on oeis.org

2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Offset: 0

Views

Author

Henry Gould, May 29 2000

Keywords

Comments

Arises in Gilbreath-Proth conjecture; see A036262.
a(n) is also the continued fraction for (3+sqrt(5))/2. - Enrique Pérez Herrero, May 16 2010
a(n) is also the denominator for odd Bernoulli Numbers. - Enrique Pérez Herrero, Jul 17 2010
a(n) = 3 - A040000(n); a(n) = A182579(n+1,1). - Reinhard Zumkeller, May 07 2012
From Paul Curtz, Feb 04 2014: (Start)
Difference table of a(n):
2, 1, 1, 1, 1, 1, 1, ...
-1, 0, 0, 0, 0, 0, 0, ...
1, 0, 0, 0, 0, 0, 0, ...
-1, 0, 0, 0, 0, 0, 0, ...
1, 0, 0, 0, 0, 0, 0, ...
-1, 0, 0, 0, 0, 0, 0, ... .
a(n) is an autosequence of second kind. Its inverse binomial transform is the signed sequence with the main diagonal (here A000038) double of the following diagonal (here A000007). Here the other diagonals are also A000007.
b(n) = A000032(n) - a(n) = 0, 0, 2, 3, 6, 10, 17, 28, ... = 0, followed by A001610(n) is the autosequence of second kind preceding A000032(n).
The corresponding autosequence of first kind, 0 followed by 1's, is A057427(n).
The Akiyama-Tanigawa transform applied to a(n) yields a(n).
(End)
Harmonic or factorial (base) expansion of e, cf. MathWorld link. - M. F. Hasler, Nov 25 2018
Decimal expansion of 19/90. - Elmo R. Oliveira, Aug 09 2024

Crossrefs

Programs

Formula

a(n) = A027642(2*n+1). - Enrique Pérez Herrero, Jul 17 2010
G.f.: (2-x)/(1-x). - Wolfdieter Lang, Oct 05 2014
Sum_{k>=1} a(n)/n! = exp(1). - G. C. Greubel, Nov 26 2018