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 A063996 #18 Nov 18 2019 03:22:14
%S A063996 3,6,9,12,18,24,27,36,48,54,72,81,96,108,144,162,192,210,216,243,288,
%T A063996 324,384,420,432,486,576,630,648,729,768,840,864,972,1050,1152,1260,
%U A063996 1296,1458,1470,1536,1680,1728,1890,1944,2100,2187,2304,2520,2592,2916
%N A063996 Numbers k such that ud(k) = sopf(k)-1, where ud(k)=A034444(k) and sopf(k)=A008472(k).
%H A063996 Amiram Eldar, <a href="/A063996/b063996.txt">Table of n, a(n) for n = 1..10000</a> (term 1..1000 from Harry J. Smith)
%o A063996 (PARI) sopf(n,s,fac,i)=fac=factor(n); for(i=1,matsize(fac)[1], s=s+fac[i,1]); return(s); ud(n) = 2^omega(n); j=[]; for(n=1,7000, if(ud(n)==sopf(n)-1, j=concat(j,n))); j
%o A063996 (PARI) sopf(n)= { local(f,s=0); f=factor(n); for(i=1, matsize(f)[1], s+=f[i, 1]); return(s) } { n=0; for (m=1, 10^9, if (2^omega(m)==sopf(m) - 1, write("b063996.txt", n++, " ", m); if (n==1000, break)) ) } \\ _Harry J. Smith_, Sep 05 2009
%Y A063996 Cf. A034444, A008472.
%K A063996 easy,nonn
%O A063996 1,1
%A A063996 _Jason Earls_, Sep 06 2001