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 A326610 #21 Jul 17 2019 12:33:31 %S A326610 0,3,26,11,14,59,83,23,443,338,263,578,38,662,47,227,3467,1823,842, %T A326610 4898,983,4622,4847,2747,4127,11567,347,542,17483,2867,22367,43067, %U A326610 18527,5042,5063,12422,66047,2858,87302,11702,11147,3062,24602,158,94763,247838,1202 %N A326610 Least k such that A000790(k) = A108574(n). %C A326610 The largest term is a(106) = 10009487 (for the primary pretender 453). %H A326610 Richard N. Smith, <a href="/A326610/b326610.txt">Table of n, a(n) for n = 1..132</a> %H A326610 N. J. A. Sloane, <a href="http://neilsloane.com/doc/Me213.pdf">The primary pretenders</a> %H A326610 Richard N. Smith, <a href="/A326610/a326610.txt">Least positive and negative bases such that the primary pretender is n (format: n (in A108574), least positive base, least negative base)</a> %Y A326610 Cf. A000790, A108574. %K A326610 nonn,fini,full %O A326610 1,2 %A A326610 _Richard N. Smith_, Jul 14 2019