login
Smallest number having Fibonacci(n) as least primitive root, or 0 if no such number exists.
1

%I #16 Nov 01 2018 12:24:51

%S 2,2,3,4,6,0,457,362,48889,108362,3418682

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

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

%e a(8) = 362 because 362 is the first number 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[j = FromDigits[ Flatten[ Position[ a, PrimitiveRoot[n]]]]; If[ b[[j]] == 0, b[[j]] = n], {n, 2, 10^6}]; b

%Y Cf. A083701, A214158.

%K nonn,more

%O 1,1

%A _Sven Simon_, May 04 2003

%E Offset 1 from _Michel Marcus_, Oct 30 2018

%E a(4) corrected by _Jianing Song_, Oct 31 2018