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 A247095 #14 Feb 05 2022 16:21:26 %S A247095 8,7,6,5,13,30,29,157,317,626,3095,6637,26833,145687,461938,1068037, %T A247095 16007153,54690697 %N A247095 Smallest number m such that A250030(m) = n. %F A247095 A250030(a(n)) = n and A250030(m) != n for m < a(n). %o A247095 (Haskell) %o A247095 import Data.List (elemIndex); import Data.Maybe (fromJust) %o A247095 a247095 = (+ 5) . fromJust . (`elemIndex` a250030_list) %o A247095 (PARI) A008474(n)=my(f=factor(n)); sum(i=1, #f~, f[i, 1]+f[i, 2]); %o A247095 f(n)=my(k); while(n!=5, n=A008474(n); k++); k; \\ A250030 %o A247095 a(n) = my(k=5); while(f(k) != n, k++); k; \\ _Michel Marcus_, Feb 05 2022 %Y A247095 Cf. A008474, A250030. %K A247095 nonn,more %O A247095 1,1 %A A247095 _Reinhard Zumkeller_, Nov 18 2014 %E A247095 a(17)-a(18) from _Michel Marcus_, Feb 05 2022