1,1

(*Mathematica's Fibonacci function is not used so as to speed up the search.*) f = {1, 1}; a = {}; Do[ l = Length[f]; n = f[[l]] + f[[l - 1]]; f = Append[f, n]; If[Mod[n, Prime[i]] == 0, a = Append[a, i]], {i, 3, 10^7}]; a

(PARI) v=0; w=1; for(n=2, m, f=v+w; if(f%prime(n)==0, print1(n, ", ")); v=w; w=f)

Sequence in context: A115435 A116095 A118576 this_sequence A061335 A116074 A035872

Adjacent sequences: A075699 A075700 A075701 this_sequence A075703 A075704 A075705

nonn

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Oct 02 2002

Three more terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 04 2002