This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A257967 Primes in the 11th-order Fibonacci numbers A127624. 2
 11, 41, 641, 10462721, 20920321, 10917370260001, 364090824435675874561, 3037065045777476472194281921, 97067184407836614348142428161, 3237159714751144204638073829896089601, 26434543100644872259207947255028288307201, 3600373169282616313621210190325730096037120382894091 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(13) is too large to display here. It has 61 digits and is the 210th term in A127624. LINKS 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. MATHEMATICA a={1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}; step=11; offset=1; lst={}; For[n=step+offset, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst, sum]]; a=RotateLeft[a]; a[[step]]=sum]; lst CROSSREFS Cf. A127624, A257966. Sequence in context: A082424 A153173 A050526 * A104118 A159561 A020452 Adjacent sequences:  A257964 A257965 A257966 * A257968 A257969 A257970 KEYWORD nonn AUTHOR Robert Price, May 14 2015 STATUS approved

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

Last modified December 16 04:05 EST 2019. Contains 330013 sequences. (Running on oeis4.)