Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054015
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054015 Chowla function of n read modulo (number of proper divisors of n). +0
5
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; listen)
OFFSET

1,6

COMMENT

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: A112983 A112609 A134363 this_sequence A056137 A139354 A124762

Adjacent sequences: A054012 A054013 A054014 this_sequence A054016 A054017 A054018

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research