login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

Next term >= 276000000. - Robert G. Wilson v, May 12 2003

LINKS

Table of n, a(n) for n=1..11.

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

Cf. A023048, A083702.

Sequence in context: A265801 A098738 A291742 * A076996 A139148 A293246

Adjacent sequences:  A083698 A083699 A083700 * A083702 A083703 A083704

KEYWORD

nonn,more

AUTHOR

Sven Simon, May 04 2003

EXTENSIONS

Offset 1 from Michel Marcus, Oct 30 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 01:40 EDT 2019. Contains 328025 sequences. (Running on oeis4.)