The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054014 Chowla function of n read modulo (the number of divisors of n). 5

%I

%S 0,0,0,2,0,1,0,2,0,3,0,3,0,1,0,4,0,2,0,3,2,1,0,3,2,3,0,3,0,1,0,0,2,3,

%T 0,0,0,1,0,1,0,5,0,3,2,1,0,5,1,0,0,3,0,1,0,7,2,3,0,11,0,1,4,6,2,5,0,3,

%U 2,1,0,2,0,3,0,3,2,1,0,5,4,3,0,7,2,1,0,3,0,11,0,3,2,1,0,11,0,0,2,8,0,1,0

%N Chowla function of n read modulo (the number of divisors of n).

%C Chowla's function (A048050) = sum of divisors of n except 1 and n.

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

%F a(n) = A048050(n) mod A000005(n).

%p with(numtheory): [seq((sigma(i)-i-1) mod tau(i),i=1..120)];

%t Array[Mod[DivisorSigma[1, #] - # - 1, DivisorSigma[0, #]] &, 103] (* _Michael De Vlieger_, Oct 30 2017 *)

%o (PARI) A054014(n) = ((sigma(n)-n-1) % numdiv(n)); \\ _Antti Karttunen_, Oct 30 2017

%Y Cf. A000005, A048050, A054013, A054015.

%K nonn

%O 1,4

%A Asher Auel (asher.auel(AT)reed.edu), Jan 17 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 28 11:13 EST 2022. Contains 350655 sequences. (Running on oeis4.)