login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A230016
Indices of primes in the tribonacci-like sequence, A214825.
0
1, 2, 3, 4, 5, 6, 7, 10, 16, 17, 26, 32, 104, 109, 120, 133, 312, 546, 608, 2274, 2527, 2932, 4462, 4680, 6001, 7103, 17402, 17874, 20664, 26341, 27954, 32869, 36204, 41521, 49065, 64172, 66318, 196078
OFFSET
1,2
COMMENTS
a(39) > 2*10^5.
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, 3, 3}; Print[1]; Print[2]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]
KEYWORD
nonn
AUTHOR
Robert Price, Feb 22 2014
STATUS
approved