login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Sum of odd divisors of 1+sigma(n).
6

%I #10 Jan 01 2022 16:25:26

%S 1,1,6,1,8,14,13,1,8,20,14,30,24,31,31,1,20,6,32,44,48,38,31,62,1,44,

%T 42,80,32,74,48,1,57,72,57,24,56,62,80,112,44,98,78,108,80,74,57,156,

%U 30,48,74,156,72,133,74,133,121,112,62,183,104,98,192,1,108,180,96,128,98,180,74,57,124,144,156,192,98

%N Sum of odd divisors of 1+sigma(n).

%H Antti Karttunen, <a href="/A336696/b336696.txt">Table of n, a(n) for n = 1..16384</a>

%H Antti Karttunen, <a href="/A336696/a336696.txt">Data supplement: n, a(n) computed for n = 1..65537</a>

%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>

%F a(n) = A000593(1+A000203(n)) = A000593(A088580(n)) = A000593(A332459(n)).

%t Table[Total[Select[Divisors[1+DivisorSigma[1,n]],OddQ]],{n,80}] (* _Harvey P. Dale_, Jan 01 2022 *)

%o (PARI)

%o A000593(n) = sigma(n>>valuation(n, 2));

%o A336696(n) = A000593(1+sigma(n));

%Y Cf. A000203, A000593, A088580, A193337, A324294, A332459, A336691, A336692, A336693, A336694, A336696.

%K nonn

%O 1,3

%A _Antti Karttunen_, Jul 31 2020