login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A227880 Primes in the union of all n-Fibonacci sequences. 2
2, 3, 5, 7, 13, 29, 31, 61, 89, 127, 149, 233, 401, 509, 773, 1021, 1597, 4093, 8191, 16381, 28657, 31489, 128257, 131071, 514229, 524287, 1048573, 4194301, 5976577, 16777213, 433494437, 536870909, 2147483647, 2971215073, 4293722117, 5350220959, 13435170943 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
T. D. Noe, Table of n, a(n) for n = 1..127 (first 62 terms from Robert Price)
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4
FORMULA
Primes in A124168.
MATHEMATICA
plst = {}; plimit=10^39; For[n = 2, n ≤ 1 + Log[2, plimit], n++, flst = {}; For[i = 1, i < n, i++, AppendTo[flst, 0]]; AppendTo[flst, 1]; For[k = 2, k ≤ 1 + Log[GoldenRatio, plimit*Sqrt[5] + 0.5], k++, sum = 0; For[j = 0, j < n, j++, sum = sum + flst[[j + k - 1]]]; AppendTo[flst, sum]; If[sum ≤ plimit && PrimeQ[sum], AppendTo[plst, sum]]]]; Union[plst]
CROSSREFS
Sequence in context: A270391 A172508 A272107 * A167134 A071905 A306317
KEYWORD
nonn
AUTHOR
Robert Price, Oct 25 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 12:27 EDT 2024. Contains 373677 sequences. (Running on oeis4.)