login
This site is supported by donations 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, 7, 6, 0, 457, 362, 48889, 108362, 3418682 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

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

Cf. A083701.

Sequence in context: A051301 A002583 A068519 * A108041 A095017 A141559

Adjacent sequences:  A083699 A083700 A083701 * A083703 A083704 A083705

KEYWORD

nonn

AUTHOR

Sven Simon (sven-h.simon(AT)t-online.de), May 04 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 17:13 EST 2012. Contains 205828 sequences.