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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054015 Chowla function of n read modulo (number of proper divisors of n). 4
0, 0, 0, 0, 0, 2, 0, 0, 1, 1, 0, 0, 0, 0, 2, 2, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 2, 0, 6, 0, 0, 2, 1, 0, 6, 0, 0, 1, 0, 0, 4, 0, 4, 2, 1, 0, 3, 1, 2, 2, 0, 0, 2, 1, 0, 1, 1, 0, 8, 0, 0, 0, 2, 0, 0, 0, 2, 2, 3, 0, 1, 0, 0, 3, 3, 0, 5, 0, 6, 3, 1, 0, 7, 1, 0, 2, 0, 0, 0, 2, 0, 1, 1, 0, 1, 0, 2, 1, 4, 0, 1, 0, 0, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

COMMENTS

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

FORMULA

a(n) = A048050(n) mod A032741(n)

MAPLE

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

CROSSREFS

Cf. A032741, A048050, A054013, A054014.

Sequence in context: A158785 A112609 A134363 * A056137 A172099 A170957

Adjacent sequences:  A054012 A054013 A054014 * A054016 A054017 A054018

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 15 21:56 EST 2012. Contains 205860 sequences.