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.

A366873 a(n) = A113415(A163511(n)), where A113415(n) is the average of number of and sum of odd divisors of n.

This page as a plain text file.
%I A366873 #10 Oct 27 2023 13:11:46
%S A366873 1,1,1,3,1,8,3,4,1,22,8,17,3,14,4,5,1,63,22,80,8,65,17,30,3,42,14,26,
%T A366873 4,18,5,7,1,185,63,393,22,316,80,202,8,206,65,174,17,117,30,68,3,124,
%U A366873 42,127,14,100,26,50,4,55,18,38,5,26,7,8,1,550,185,1956,63,1567,393,1403,22,1020,316,1204,80,804,202
%N A366873 a(n) = A113415(A163511(n)), where A113415(n) is the average of number of and sum of odd divisors of n.
%H A366873 Antti Karttunen, <a href="/A366873/b366873.txt">Table of n, a(n) for n = 0..16384</a>
%F A366873 a(n) = (1/2) * (A324186(n)+A366797(n)).
%o A366873 (PARI)
%o A366873 A113415(n) = if(n<1, 0, sumdiv(n, d, if(d%2, (d+1)/2)));
%o A366873 A163511(n) = if(!n, 1, my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
%o A366873 A366873(n) = A113415(A163511(n));
%Y A366873 Cf. A113415, A163511, A366874 (rgs-transform).
%Y A366873 Cf. also A324186, A366797, A366875.
%K A366873 nonn
%O A366873 0,4
%A A366873 _Antti Karttunen_, Oct 27 2023