This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054013 Chowla function of n read modulo n. 6

%I

%S 0,0,0,2,0,5,0,6,3,7,0,3,0,9,8,14,0,2,0,1,10,13,0,11,5,15,12,27,0,11,

%T 0,30,14,19,12,18,0,21,16,9,0,11,0,39,32,25,0,27,7,42,20,45,0,11,16,7,

%U 22,31,0,47,0,33,40,62,18,11,0,57,26,3,0,50,0,39,48,63,18,11,0,25,39,43,0

%N Chowla function of n read modulo n.

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

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

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

%t Table[Mod[DivisorSigma[1,n]-n-1,n],{n,90}] (* From Harvey P. Dale, Dec 01 2011 *)

%Y Cf. A048050, A054014, 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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .