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”).
%I #16 May 23 2019 16:58:43
%S 1,2,4,10,11,12,13,58,63,89,132,157,426,457,506,613,1839,1936,2042,
%T 2355,3178,3782,8556,8688,22152,23232,44074,71770,222666
%N Indices of primes in A214829.
%C a(30) > 222666.
%H Tony D. Noe and Jonathan Vos Post, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL8/Noe/noe5.html">Primes in Fibonacci n-step and Lucas n-step Sequences</a>, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4
%t a={1,7,7}; Print["1"]; Print["2"]; For[n=3, n<=1000, n++, sum=Plus@@a; If[PrimeQ[sum], Print[n]]; a=RotateLeft[a]; a[[3]]=sum]
%Y Cf. A001590, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523,A214825, A235862, A214827, A214828.
%K nonn,more
%O 1,2
%A _Robert Price_, Jun 07 2014
%E a(27) corrected by _Robert Price_, May 22 2019
%E a(29) from _Robert Price_, May 23 2019