A215026 Reluctant Fibonacci sequence.

1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 5, 1, 1, 2, 1, 2, 3, 5, 8, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 5, 8, 13, 1

Offset

1,3

References

Donald E. Knuth, The Art of Computer Programming, Vol. 4, Pre-Fascicle 6A, Section 7.2.2.2, Problem 178, page 54.

Donald E. Knuth, Satisfiability, Fascicle 6, volume 4 of The Art of Computer Programming. Addison-Wesley, 2015, page 160, Problem 310; see solution on page 246.

Links

Table of n, a(n) for n=1..33.

Crossrefs

Cf. A000045, A182105.

Sequence in context: A348390 A133674 A348245 * A162319 A237594 A098666

Adjacent sequences: A215023 A215024 A215025 * A215027 A215028 A215029

Keyword

nonn,more

Author

N. J. A. Sloane, Aug 03 2012

Status

approved