This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A054505 #15 Jul 02 2025 16:01:59
%S A054505 1,1,2,1,1,14,1,2,1,24,1,26,27,18,1,1,1,1,6,8,4,1,16,34,1,44,1,57,12,
%T A054505 72,1,10,1,1,70,141,1,40,1,1,1,44,34,1,106,1,180,1,21,72,66,190,235,
%U A054505 48,190,1,154,147,204,159,1,93,22,274,1,121,304,1,1,164,314,292,1,1,134,1
%N A054505 Log_b 2 where b is smallest primitive root (A001918) mod n-th prime.
%D A054505 Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, Table 10.2, pp. 216-217.
%H A054505 Amiram Eldar, <a href="/A054505/b054505.txt">Table of n, a(n) for n = 2..10000</a>
%e A054505 Smallest primitive root mod 7 is 3; 2 = 3^2 mod 7; 7 is 4th prime; so a(4) = 2.
%t A054505 a[n_] := Module[{p, b, lg = 1}, b = PrimitiveRoot[p = Prime[n]]; While[ PowerMod[b, lg, p] != 2 , lg++]; lg]; Array[a, 100, 2] (* _Jean-François Alcover_, Sep 03 2016 *)
%Y A054505 Cf. table in A054503.
%Y A054505 Cf. A001918, A054506, A054507, A054508, A054509, A054510, A054511, A054512, A054513.
%K A054505 nonn,easy
%O A054505 2,3
%A A054505 _N. J. A. Sloane_, Apr 09 2000
%E A054505 More terms from _James Sellers_, Apr 09 2000