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.

Showing 1-2 of 2 results.

A094411 Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.

Original entry on oeis.org

5777, 10877, 75077, 80189, 100127, 113573, 161027, 162133, 231703, 430127, 618449, 635627, 667589, 851927, 1033997, 1106327, 1256293, 1388903, 1697183, 2263127, 2435423, 2512889, 2662277, 3175883, 3399527, 3452147, 3774377
Offset: 1

Views

Author

Eric Rowland, May 01 2004

Keywords

Comments

Also composites k that divide both Fibonacci(k+1) and Lucas(k) - 1. - Gary Detlefs, Feb 28 2013

Crossrefs

Programs

  • Mathematica
    Select[Range[2, 50000], ! PrimeQ[ # ] && Mod[Fibonacci[ # + 1], # ] == 0 && Mod[Fibonacci[ # ] + 1, # ] == 0 &]

Extensions

More terms from Gareth McCaughan, Jun 11 2004
More terms from Ryan Propper, Aug 04 2005
Offset corrected by Giovanni Resta, Jul 20 2013

A094413 Odd composites k that divide Fibonacci(k) + 1 but not Fibonacci(k+1).

Original entry on oeis.org

17261, 120581, 163059, 300847, 1842581, 3489641, 3792541, 5573499, 21159271, 36561959, 40779991, 63055651, 67306519, 69503037, 72125899, 129487163, 136021717, 174008141, 175094767, 247600477, 418623283, 529281911, 814454381, 902315699
Offset: 1

Views

Author

Eric Rowland, May 07 2004

Keywords

Crossrefs

Programs

  • PARI
    isok(n) = (n % 2) && ! ((fibonacci(n) + 1) % n) && (fibonacci(n+1) % n); \\ Michel Marcus, Aug 27 2013

Extensions

4 more terms from Ryan Propper, Aug 03 2005
a(9)-a(24) from Giovanni Resta, Jul 20 2013
Showing 1-2 of 2 results.