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.

A135953 (Nonprime Fibonacci numbers with prime indices) that have exactly 2 prime factors.

Original entry on oeis.org

4181, 1346269, 165580141, 53316291173, 956722026041, 2504730781961, 308061521170129, 806515533049393, 14472334024676221, 1779979416004714189, 573147844013817084101, 10284720757613717413913, 26925748508234281076009
Offset: 1

Views

Author

Artur Jasinski, Dec 08 2007

Keywords

Comments

Conjecture: All numbers in this sequence are products of two sums of two squares, e.g. 4181 = 37*113 = (1^2+6^2)*(7^2+8^2), 1346269 = 557*2417 = (14^2+19^2)*(4^2+49^2).

Crossrefs

Programs

  • Mathematica
    k = {}; Do[If[ !PrimeQ[Fibonacci[Prime[n]]], c = Length[FactorInteger[Fibonacci[Prime[n]]]]; If[c == 2, AppendTo[k, Fibonacci[Prime[n]]]]], {n, 1, 50}]; k
    Select[Fibonacci[Prime[Range[30]]],PrimeOmega[#]==2&] (* Harvey P. Dale, Feb 18 2012 *)