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.

A121567 Fibonacci[ (p - 1) ], where p = Prime[n].

Original entry on oeis.org

1, 1, 3, 8, 55, 144, 987, 2584, 17711, 317811, 832040, 14930352, 102334155, 267914296, 1836311903, 32951280099, 591286729879, 1548008755920, 27777890035288, 190392490709135, 498454011879264, 8944394323791464
Offset: 1

Views

Author

Alexander Adamchuk, Aug 07 2006

Keywords

Comments

p = Prime[n] divides a(n) = Fibonacci(p-1) for p = {11,19,29,31,41,59,61,71,79,89,101,109,131,...} = A045468[n] Primes congruent to {1, 4} mod 5.

Crossrefs

Programs

  • Mathematica
    Table[Fibonacci[Prime[n]-1],{n,1,30}]

Formula

a(n) = Fibonacci[ Prime[n] - 1 ].