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 A195331 #12 Mar 17 2020 21:17:36 %S A195331 25,26,34,112,53,27,132,35,28,172,265,73,192,353,273,345,267,235,29, %T A195331 232,347,54,275,273,36,283,292,537,277,312,210,373,355,254,285,113, %U A195331 372,236,293,412,357,573,287,432,354,211,37,133,472,74,2355,2254,295,2534,2583,2113,2372,2373,2643,532,2811,2589,2236,2723,2647,2103,2597,55,2672,2752,2813,2412,3353,2653,2357,2573,2733,592,3443,297,365,2432,2729,612,2354,2659,3447,2835,2435,2661,2731 %N A195331 A080670 applied to A195330(n). %C A195331 A195330 gives the numbers k such that A080670(k) < k; this sequence gives the corresponding values of A080670(k). %H A195331 Alois P. Heinz, <a href="/A195331/b195331.txt">Table of n, a(n) for n = 1..10000</a> (first 220 terms from Robert Price) %p A195331 b:= proc(n) option remember; `if`(n=1, 1, (l-> %p A195331 parse(cat(seq(`if`(l[i, 2]=1, l[i, 1], [l[i, 1], %p A195331 l[i, 2]][]), i=1..nops(l)))))(sort(ifactors(n)[2]))) %p A195331 end: %p A195331 g:= proc(n) option remember; local k; for k from %p A195331 `if`(n=1, 0, g(n-1))+1 while b(k)>=k do od; k %p A195331 end: %p A195331 a:= n-> b(g(n)): %p A195331 seq(a(n), n=1..100); # _Alois P. Heinz_, Mar 17 2020 %t A195331 A080670 = Cases[Import["https://oeis.org/A080670/b080670.txt", "Table"], {_, _}][[All, 2]]; %t A195331 A195330 = Cases[Import["https://oeis.org/A195330/b195330.txt", "Table"], {_, _}][[All, 2]]; %t A195331 Table[A080670[[n]], {n, A195330}](* _Robert Price_, Mar 17 2020 *) %Y A195331 Cf. A080670, A195330. %K A195331 nonn,base %O A195331 1,1 %A A195331 _N. J. A. Sloane_, Sep 15 2011