Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054025
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054025 Sum of divisors of n read modulo (number of divisors of n). +0
5
0, 1, 0, 1, 0, 0, 0, 3, 1, 2, 0, 4, 0, 0, 0, 1, 0, 3, 0, 0, 0, 0, 0, 4, 1, 2, 0, 2, 0, 0, 0, 3, 0, 2, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 3, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 3, 0, 2, 4, 2, 0, 0, 0, 6, 1, 2, 0, 8, 0, 0, 0, 4, 0, 6, 0, 0, 0, 0, 0, 0, 0, 3, 0, 1, 0, 0, 0, 2, 0 (list; graph; listen)
OFFSET

1,8

FORMULA

a(n) = A000203(n) mod A000005(n), sigma(n) mod tau(n)

MAPLE

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

CROSSREFS

Cf. A000005, A000203.

Sequence in context: A095199 A074735 A074090 this_sequence A054869 A056931 A139569

Adjacent sequences: A054022 A054023 A054024 this_sequence A054026 A054027 A054028

KEYWORD

nonn

AUTHOR

Asher Auel (asher.auel(AT)reed.edu) Jan 19, 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 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research