cp's OEIS Frontend

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.

A336694 a(n) = A329697(1+sigma(n)), where A329697 is totally additive with a(2) = 0 and a(p) = 1 + a(p-1) for odd primes.

This page as a plain text file.
%I A336694 #7 Jul 31 2020 16:43:06
%S A336694 0,0,1,0,2,2,2,0,2,3,2,3,2,2,2,0,3,1,3,4,3,3,2,3,0,4,2,4,3,3,3,0,4,3,
%T A336694 4,3,3,3,4,4,4,2,3,2,4,3,4,3,3,4,3,4,3,4,3,4,4,4,3,4,4,2,4,0,2,4,4,5,
%U A336694 2,4,3,4,3,4,3,5,2,4,4,3,3,5,2,4,4,5,4,4,4,5,3,4,5,4,4,5,4,4,4,4,3,5,4,5,2
%N A336694 a(n) = A329697(1+sigma(n)), where A329697 is totally additive with a(2) = 0 and a(p) = 1 + a(p-1) for odd primes.
%H A336694 Antti Karttunen, <a href="/A336694/b336694.txt">Table of n, a(n) for n = 1..65537</a>
%H A336694 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A336694 a(n) = A329697(1+A000203(n)) = A329697(A088580(n)) = A329697(A332459(n)).
%o A336694 (PARI)
%o A336694 A329697(n) = { my(f=factor(n)); sum(k=1,#f~,if(2==f[k,1],0,f[k,2]*(1+A329697(f[k,1]-1)))); };
%o A336694 A336694(n) = A329697(1+sigma(n));
%Y A336694 Cf. A000203, A088580, A324294, A329697, A332459, A336691, A336692, A336693, A336695, A336696.
%K A336694 nonn
%O A336694 1,5
%A A336694 _Antti Karttunen_, Jul 31 2020