|
%I #7 Feb 27 2016 16:48:35
%S 10,12,232,502
%N Indices of primes in the 9th-order Fibonacci number sequence, A251751.
%C a(5) > 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={0,0,1,0,0,0,0,0,0}; step=9; lst={}; For[n=step,n<=1000,n++, sum=Plus@@a; If[PrimeQ[sum], AppendTo[lst,n]]; a=RotateLeft[a]; a[[step]]=sum]; lst
%t Flatten[Position[LinearRecurrence[Table[1,{9}],{0,0,1,0,0,0,0,0,0},510], _?(PrimeQ[#]&)]]-1 (* _Harvey P. Dale_, Feb 27 2016 *)
%Y Cf. A001590, A001631, A100683, A231574, A231575, A232542, A214899, A230607, A020992, A232498, A214727, A081172, A214752, A141523, A214825, A235862, A000288, A000322, A000383, A249413, A060455, A079262, A251751.
%K nonn,more
%O 1,1
%A _Robert Price_, Feb 24 2015
|
