login
A083701
Smallest prime having Fibonacci(n) as least primitive root, or 0 if no such prime exists.
2
2, 2, 3, 7, 23, 0, 457, 409, 48889, 459841, 6366361
OFFSET
1,1
COMMENTS
Next term >= 276000000. - Robert G. Wilson v, May 12 2003
FORMULA
a(n) = A023048(A000045(n)). - Jianing Song, Oct 31 2018
EXAMPLE
a(8) = 409 because 409 is the first prime having Fibonacci(8) = 21 as least primitive root
MATHEMATICA
<< NumberTheory`NumberTheoryFunctions`; a = Table[ Fibonacci[i], {i, 2, 20}]; b = Table[0, {20}]; k = 1; Do[k = NextPrime[k]; j = FromDigits[ Flatten[ Position[ a, PrimitiveRoot[k]]]]; If[ b[[j]] == 0, b[[j]] = k], {n, 1, 10^6}]; b
CROSSREFS
Sequence in context: A265801 A098738 A291742 * A076996 A139148 A293246
KEYWORD
nonn,more
AUTHOR
Sven Simon, May 04 2003
EXTENSIONS
Offset 1 from Michel Marcus, Oct 30 2018
STATUS
approved