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 A290080 #5 Jul 23 2017 21:49:25 %S A290080 0,1,1,3,1,3,1,4,3,3,1,4,1,3,3,7,1,4,1,4,3,3,1,7,3,3,4,4,1,4,1,6,3,3, %T A290080 3,7,1,3,3,7,1,4,1,4,4,3,1,6,3,4,3,4,1,7,3,7,3,3,1,7,1,3,4,12,3,4,1,4, %U A290080 3,4,1,6,1,3,4,4,3,4,1,6,7,3,1,7,3,3,3,7,1,7,3,4,3,3,3,12,1,4,4,7,1,4,1,7,4 %N A290080 a(1) = 0; for n > 1, a(n) = sigma(bigomega(n)). %H A290080 Antti Karttunen, <a href="/A290080/b290080.txt">Table of n, a(n) for n = 1..10000</a> %H A290080 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A290080 a(1) = 0; for n > 1, a(n) = A000203(A001222(n)). %F A290080 a(n) = A193511(n) + A193512(n). %o A290080 (Scheme) (define (A290080 n) (if (= 1 n) 0 (A000203 (A001222 n)))) %Y A290080 Cf. A000203, A001222, A193511, A193512. %Y A290080 Differs from A289617 for the first time at n=32, where a(n) = 6, while A289617(32) = 8. %K A290080 nonn %O A290080 1,4 %A A290080 _Antti Karttunen_, Jul 23 2017