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.

A366879 a(n) = A326938(A163511(n)), where A326938 is the Dirichlet inverse of the sum of divisors d of n such that n/d is odd.

This page as a plain text file.
%I A366879 #6 Oct 27 2023 16:39:46
%S A366879 1,-2,0,-4,0,3,8,-6,0,0,-6,5,0,24,12,-8,0,0,0,0,0,-20,-10,7,0,-18,-48,
%T A366879 48,0,32,16,-12,0,0,0,0,0,0,0,0,0,15,40,-42,0,-28,-14,11,0,0,36,-40,0,
%U A366879 -192,-96,96,0,-24,-64,72,0,48,24,-14,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,-30,35,0,168,84
%N A366879 a(n) = A326938(A163511(n)), where A326938 is the Dirichlet inverse of the sum of divisors d of n such that n/d is odd.
%H A366879 Antti Karttunen, <a href="/A366879/b366879.txt">Table of n, a(n) for n = 0..16384</a>
%H A366879 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%o A366879 (PARI)
%o A366879 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 A366879 A326938(n) = sumdiv(n, d, if(n/d%2, moebius(n/d)*moebius(d)*d));
%o A366879 A366879(n) = A326938(A163511(n));
%Y A366879 Cf. A002131, A163511, A326938, A366880 (rgs-transform).
%Y A366879 Cf. also A366875.
%K A366879 sign
%O A366879 0,2
%A A366879 _Antti Karttunen_, Oct 27 2023