|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
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
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|