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.

A135970 Fibonacci(Mersenne primes): a(n) = Fibonacci(A000668(n)).

Original entry on oeis.org

2, 13, 1346269, 155576970220531065681649693
Offset: 1

Views

Author

Artur Jasinski, Dec 09 2007

Keywords

Comments

This sequence is a subsequence of A101342. The next term, a(5), has 1712 digits.

Crossrefs

Programs

  • Mathematica
    k = {}; Do[If[PrimeQ[2^n - 1], AppendTo[k, Fibonacci[2^n - 1]]], {n, 1, 15}]; k
    Fibonacci/@Select[Table[2^Prime[n]-1,{n,5}],PrimeQ] (* Harvey P. Dale, May 06 2018 *)