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 A226462 #13 Dec 14 2018 20:20:45 %S A226462 0,2,5,11,23,47,83,167,179,359,1679,719,1439,2879,3959,2159,2519, %T A226462 10799,5039,9239,12599,7559,20159,31679,27719,37799,45359,30239 %N A226462 Smallest number m such that A226460(m) = n. %C A226462 a(31) = 90719, a(32) = 55439, a(34) = 83159, all others are >= 100000. Most terms are one less than a largely composite number (A067128). - _Charlie Neder_, Nov 03 2018 %H A226462 Charlie Neder, <a href="/A226462/a226462.py.txt">Python program for computing this sequence</a> (Outputs terms sorted by a(n), not n) %Y A226462 Cf. A048247. %K A226462 nonn,more %O A226462 0,2 %A A226462 _Naohiro Nomoto_, Jun 08 2013 %E A226462 a(9)-a(27) from _Charlie Neder_, Nov 04 2018