OFFSET
1,2
COMMENTS
See A000057 to corresponding prime numbers. In other words, this sequence is an indirect way to generate primes dividing all Fibonacci sequences.
LINKS
Michel Marcus, Table of n, a(n) for n = 1..1000
PROG
(PARI) f(n) = prod(k=1, n, fibonacci(k)); \\ A003266
isok(n) = (lift(Mod(f(prime(n)), (prime(n)*(prime(n)+1)/2))) != 0);
(PARI) isok(n) = my(p=prime(n), m=p*(p+1)/2); prod(k=1, p, Mod(fibonacci(k), m)); \\ Michel Marcus, May 14 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
Altug Alkan, Mar 18 2016
STATUS
approved