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 A119841 #12 Mar 03 2016 05:44:57
%S A119841 1,2,5,14,48,42,2452,462,132,183958,6006,4877756,429,1680384,24024,
%T A119841 17454844,87516,20071150430,1430,409158464142,1662804,1941406508,
%U A119841 1385670,129586764260850,4862,269333638458151764,140229804,6405442434150,242201554680,6708527580006468
%N A119841 Distinct values in A114717 in order of appearance.
%H A119841 Alois P. Heinz, <a href="/A119841/b119841.txt">Table of n, a(n) for n = 1..69</a>
%t A119841 b[s_] := b[s] = If[Length[s] < 2, 1, Sum[If[Length[Select[s, Mod[#, x] == 0 &]] == 1, b[Complement[s, {x}]], 0], {x, s}]]; a[n_] := a[n] = Module[{l, m}, l = Sort[FactorInteger[n], #1[[2]] > #2[[2]] &]; m = Product[Prime[ i]^l[[i]][[2]], {i, 1, Length[l]}]; b[Divisors[m] // Rest // Most]]; A119841 = Reap[For[k = 1, k < 2000, k++, If[FreeQ[Array[a, k - 1], a[k]], Print[k, " ", a[k]]; Sow[a[k]]]]][[2, 1]] (* _Jean-François Alcover_, Mar 03 2016, after _Alois P. Heinz_ *)
%Y A119841 a(n) = A114717(A119840(n)). Cf. A119499.
%K A119841 nonn
%O A119841 1,2
%A A119841 _Antti Karttunen_, May 26 2006
%E A119841 a(19)-a(30) from _Alois P. Heinz_, Aug 06 2012