A046698 a(0) = 0, a(1) = 1, a(n) = a(a(n-1)) + a(a(n-2)) if n > 1.

0, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2

Offset

0,4

Comments

Partial sums are A004275. Binomial transform is A048492, starting with 0. - Paul Barry, Feb 28 2003

References

Sequence proposed by Reg Allenby.

Links

Table of n, a(n) for n=0..101.

Ömür Deveci, Zafer Adıgüzel, and Taha Doğan, On the Generalized Fibonacci-circulant-Hurwitz numbers, Notes on Number Theory and Discrete Mathematics (2020) Vol. 26, No. 1, 179-190.

O. Deveci, Y. Akuzum, E. Karaduman, and O. Erdag, The Cyclic Groups via Bezout Matrices, Journal of Mathematics Research, Vol. 7, No. 2, 2015, pp. 34-41.

Eric Weisstein's World of Mathematics, Fibonacci n-Step Number

Index entries for linear recurrences with constant coefficients, signature (1).

Formula

G.f.: x*(1+x^2)/(1-x). - Paul Barry, Feb 28 2003

Mathematica

CoefficientList[Series[x (1 + x^2)/(1 - x), {x, 0, 104}], x] (* or *)
Nest[Append[#, #[[#[[-1]] + 1]] + #[[#[[-2]] + 1 ]]] &, {0, 1}, 105] (* Michael De Vlieger, Jul 31 2020 *)

Prog

(PARI) a(n)=(n>0)+(n>2)

Crossrefs

Cf. A004275, A048492.

Sequence in context: A084100 A329683 A130130 * A211662 A007395 A036453

Adjacent sequences: A046695 A046696 A046697 * A046699 A046700 A046701

Keyword

nonn,easy

Author

N. J. A. Sloane, R. K. Guy

Status

approved