OFFSET
1,2
LINKS
Chai Wah Wu, Table of n, a(n) for n = 1..287
MATHEMATICA
Do[If[Mod[Fibonacci[n-2] + Fibonacci[n], n] == 0, Print[n]], {n, 100000}] (* Ryan Propper, Jun 21 2005 *)
PROG
(PARI) is(n)=(Mod([0, 1; 1, 1], n)^(n-1)*[0; 1])[1, 1]==0 \\ Charles R Greathouse IV, Nov 04 2016
(Python)
from itertools import count, islice
from oeis_sequences.OEISsequences import lucas_mod
def A094396_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda k: not lucas_mod(k-1, k), count(max(startvalue, 1)))
CROSSREFS
KEYWORD
nonn,changed
AUTHOR
Eric Rowland, May 01 2004
EXTENSIONS
10 more terms from Ryan Propper, Jun 21 2005
More terms from Ryan Propper, Jan 03 2008
a(19)-a(27) from Lars Blomberg, Mar 16 2012
1 prepended to the sequence by T. D. Noe, Mar 16 2012
a(28)-a(30) from Chai Wah Wu, Jul 15 2026
STATUS
approved
