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 A237359 #11 Oct 02 2014 23:01:16 %S A237359 2,3,7,23,89,389,2297,13903,82829,508847 %N A237359 a(n) is the largest integer that makes A237354(a(n))=n. %C A237359 a(0)-a(7) are primes, while a(8) = 113*733. Probably, a(9) = 508847 and a(10) = 3699977. - _Giovanni Resta_, Feb 23 2014 %C A237359 Probably, a(11) = 28644529 and a(12) = 235037603. - _Hiroaki Yamanouchi_, Oct 02 2014 %e A237359 A237354(2)=0 and this is the only 0 in A237354. So a(0)=2; %e A237359 A237354(3)=1 and this is the only 1 in A237354. So a(1)=3; %e A237359 A237354(4,5,6,7)=2, the largest one is A237354(7). So a(2)=7; %e A237359 There are 10 numbers between (include) 8 and 23 that make A237354(n)=3. The largest one is 23. There is no more A237354(n)=3 checked up to n=2*3*5+1=31. So a(3)=23; %e A237359 Checked up to n=2*3*5*7+1=211, we got a(4)=89; %e A237359 Checked up to n=2*3*5*7*11+1=2311, we got a(5)=389; %e A237359 Checked up to n=2*3*5*7*11*13+1=30031, we got a(6)=2297; %Y A237359 Cf. A237354. %K A237359 nonn,hard,more %O A237359 0,1 %A A237359 _Lei Zhou_, Feb 06 2014 %E A237359 a(8) from _Giovanni Resta_, Feb 23 2014 %E A237359 a(9) from _Hiroaki Yamanouchi_, Oct 02 2014