|
Search: id:A083701
|
|
|
| A083701 |
|
Smallest prime having Fibonacci(n) as least primitive root, or 0 if no such prime exists. |
|
+0
2
|
|
| 2, 2, 3, 7, 23, 0, 457, 409, 48889, 459841, 6366361
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
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
|
Cf. A083702.
Sequence in context: A113842 A032161 A098738 this_sequence A076996 A139148 A038507
Adjacent sequences: A083698 A083699 A083700 this_sequence A083702 A083703 A083704
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Sven Simon (sven-h.simon(AT)t-online.de), May 04 2003
|
|
EXTENSIONS
|
No other entries < 276000000. - Robert G. Wilson v (rgwv(AT)rgwv.com), May 12 2003
|
|
|
Search completed in 0.002 seconds
|
