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 A064800 #18 Nov 11 2016 23:53:53 %S A064800 1,3,4,6,6,8,8,11,11,12,12,15,14,16,17,20,18,21,20,23,23,24,24,28,27, %T A064800 28,30,31,30,33,32,37,35,36,37,40,38,40,41,44,42,45,44,47,48,48,48,53, %U A064800 51,53,53,55,54,58,57,60,59,60,60,64,62,64,66,70,67,69,68,71,71,73,72 %N A064800 n plus the number of its prime factors: a(n) = n + A001222(n). %C A064800 Prime factors counted with multiplicity. - _Harvey P. Dale_, Aug 19 2015 %H A064800 Harry J. Smith, <a href="/A064800/b064800.txt">Table of n, a(n) for n=1,...,1000</a> %e A064800 a(42) = 45 = 42 + 3 (as 42 = 2 * 3 * 7) %p A064800 A064800 := proc(n) %p A064800 n+numtheory[bigomega](n) ; %p A064800 end proc: # _R. J. Mathar_, Oct 21 2012 %t A064800 Table[n + PrimeOmega[n],{n,80}] (* _Harvey P. Dale_, Aug 19 2015 *) %o A064800 (PARI) { for (n=1, 1000, write("b064800.txt", n, " ", n + bigomega(n)) ) } \\ _Harry J. Smith_, Sep 26 2009 %o A064800 (Haskell) %o A064800 a064800 n = a001222 n + n -- _Reinhard Zumkeller_, Oct 27 2012 %Y A064800 Cf. A001222, A229109. %K A064800 nonn %O A064800 1,2 %A A064800 _Reinhard Zumkeller_, Oct 21 2001