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!)
A083702 Smallest number having Fibonacci(n) as least primitive root, or 0 if no such number exists. 1
2, 2, 3, 4, 6, 0, 457, 362, 48889, 108362, 3418682 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
a(n) = A214158(A000045(n)). - Jianing Song, Oct 31 2018
EXAMPLE
a(8) = 362 because 362 is the first number 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[j = FromDigits[ Flatten[ Position[ a, PrimitiveRoot[n]]]]; If[ b[[j]] == 0, b[[j]] = n], {n, 2, 10^6}]; b
CROSSREFS
Sequence in context: A205006 A123560 A060407 * A074077 A078381 A118975
KEYWORD
nonn,more
AUTHOR
Sven Simon, May 04 2003
EXTENSIONS
Offset 1 from Michel Marcus, Oct 30 2018
a(4) corrected by Jianing Song, Oct 31 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 11:35 EDT 2024. Contains 371912 sequences. (Running on oeis4.)