login
The OEIS is supported by the many generous donors 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

%I #21 Nov 01 2018 12:25:02

%S 2,2,3,7,23,0,457,409,48889,459841,6366361

%N Smallest prime having Fibonacci(n) as least primitive root, or 0 if no such prime exists.

%C Next term >= 276000000. - _Robert G. Wilson v_, May 12 2003

%F a(n) = A023048(A000045(n)). - _Jianing Song_, Oct 31 2018

%e a(8) = 409 because 409 is the first prime having Fibonacci(8) = 21 as least primitive root

%t << 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

%Y Cf. A023048, A083702.

%K nonn,more

%O 1,1

%A _Sven Simon_, May 04 2003

%E Offset 1 from _Michel Marcus_, Oct 30 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)