login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054014 Chowla function of n read modulo (the number of divisors of n). 4
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, 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, 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 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

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

FORMULA

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

MAPLE

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

CROSSREFS

Cf. A000005, A048050, A054013, A054015.

Sequence in context: A053473 A144764 A084929 * A158945 A156667 A178090

Adjacent sequences:  A054011 A054012 A054013 * A054015 A054016 A054017

KEYWORD

nonn

AUTHOR

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 .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.