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 #6 May 10 2014 23:29:58
%S 4,7,23,71,379,467,596,6372,10100,11660,23099,25419,26011,36588,76895,
%T 112867
%N Indices of primes in the tribonacci-like sequence A214826.
%C a(17) > 2*10^5.
%H Tony D. Noe and Jonathan Vos Post, <a href="http://www.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,4,4}; 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, A214826.
%K nonn
%O 1,1
%A _Robert Price_, May 10 2014