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.

A135954 Nonprime Fibonacci numbers with prime indices (A050937) that have exactly 3 prime factors.

Original entry on oeis.org

24157817, 44945570212853, 1500520536206896083277, 50095301248058391139327916261, 11463113765491467695340528626429782121, 30010821454963453907530667147829489881, 2211236406303914545699412969744873993387956988653, 103881042195729914708510518382775401680142036775841
Offset: 1

Views

Author

Artur Jasinski, Dec 08 2007

Keywords

Comments

Conjecture: All numbers in this sequence are products of three sums of two squares.

Crossrefs

Programs

  • Mathematica
    k = {}; Do[If[ !PrimeQ[Fibonacci[Prime[n]]], c = Length[FactorInteger[Fibonacci[Prime[n]]]]; If[c == 3, AppendTo[k, Fibonacci[Prime[n]]]]], {n, 1, 50}]; k
  • PARI
    f(n) = forprime(x=2, n, p=fibonacci(x); if(!isprime(p) && omega(p) == 3, print1(p", "))) \\ Georg Fischer, Feb 15 2025

Extensions

a(6)-a(8) from Georg Fischer, Feb 15 2025