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.

A204925 a(n) is the index j < k such that n divides s(k) - s(j), where k is the least index (A204924) for which such j exists, and s=(1,2,3,5,8,13,...), the Fibonacci numbers.

Original entry on oeis.org

1, 1, 2, 1, 3, 2, 1, 4, 3, 3, 2, 1, 5, 6, 5, 4, 7, 3, 2, 1, 6, 1, 3, 10, 4, 5, 1, 4, 4, 8, 3, 2, 1, 7, 1, 10, 9, 6, 5, 11, 7, 6, 3, 1, 5, 3, 5, 10, 8, 4, 8, 3, 2, 1, 8, 5, 4, 1, 10, 16
Offset: 1

Views

Author

Clark Kimberling, Jan 21 2012

Keywords

Comments

For a guide to related sequences, see A204892.

Examples

			(See the Example section at A204924.)
		

Crossrefs

Programs

  • Mathematica
    (See the program at A204924.)