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 A110465 #6 Mar 30 2012 17:22:40
%S A110465 3,5,3,7,11,13,3,5,17,19,23,29,31,7,3,37,41,43,47,53,59,5,61,67,71,73,
%T A110465 11,79,83,3,89,97,13,101,103,107,109,113,127,131,137,139,149,151,7,
%U A110465 157,163,167,17,173,179,181,191,193,197,199,19,211,3,223,227,229,5,233,239
%N A110465 Prime numbers that when multiplied in order yield the sequence of oddly colossally abundant numbers A110464.
%C A110465 This is sequence A073751 without the "2" terms.
%t A110465 maxN=100; f={{3, 1}, {5, 0}}; primes=1; lst={3}; x=Table[pFactor[f[[i]]], {i, primes+1}]; For[n=2, n<=maxN, n++, i=Position[x, Max[x]][[1, 1]]; AppendTo[lst, f[[i, 1]]]; f[[i, 2]]++; If[i>primes, primes++; AppendTo[f, {Prime[i+2], 0}]; AppendTo[x, pFactor[f[[ -1]]]]]; x[[i]]=pFactor[f[[i]]]]; lst
%Y A110465 Cf. A004490 (colossally abundant numbers).
%K A110465 nonn
%O A110465 1,1
%A A110465 _T. D. Noe_, Jul 21 2005