1,2

lst={}; Do[If[Mod[(Fibonacci[n-2]), n]==0, If[OddQ[n], AppendTo[lst, n]]], {n, 3*8!}]; lst

a = c = 0; b = 1; lst = {}; Do[c = a + b; If[ Mod[a, n] == 0 && OddQ@n, Print@n]; a = b; b = c, {n, 2, 10^7}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 05 2009]

Cf. A123976, A159051

Sequence in context: A025409 A043388 A163559 this_sequence A065572 A074673 A020395

Adjacent sequences: A159049 A159050 A159051 this_sequence A159053 A159054 A159055

nonn

Vladimir Orlovsky (4vladimir(AT)gmail.com), Apr 03 2009

a(5) - a(9) from Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 05 2009

Edited by N. J. A. Sloane, Apr 06 2009