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 A159076 #3 Mar 30 2012 19:00:15 %S A159076 2,5,6,6,8,9,10,7,7,11,14,10,16,13,12,8,20,10,22,12,14,17,26,11,9,19, %T A159076 8,14,32,15,34,9,18,23,16,11,40,25,20,13,44,17,46,18,13,29,50,12,11, %U A159076 12,24,20,56,11,20,15,26,35,62,16,64,37,15,10,22,21,70,24,30,19,74,12,76,43 %N A159076 A008474(n) + 2. %C A159076 The numbers can be constructed from the standard prime factorization n = Product (q_k^e_k), including a factor with q=1, then a(n) = Sum (q_k + e_k). %e A159076 For n=10=1^1*2^1*5^1 the a(10)=1+1+2+1+5+1=11. %Y A159076 Cf.: A008474. %K A159076 nonn,less %O A159076 1,1 %A A159076 _Jaroslav Krizek_, Apr 04 2009 %E A159076 Edited by _R. J. Mathar_, Apr 06 2009