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

 

Logo


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

2,7

LINKS

Table of n, a(n) for n=2..106.

FORMULA

a(n) = n mod (tau(n) - 1), for n>1

MAPLE

[ seq( i mod (tau(i) - 1), i=2..150) ];

MATHEMATICA

Table[Mod[n, DivisorSigma[0, n]-1], {n, 2, 110}] (* Harvey P. Dale, Dec 05 2015 *)

CROSSREFS

Cf. A000005, A032741, A054008.

Sequence in context: A051632 A278700 A122821 * A176451 A091297 A166712

Adjacent sequences:  A054006 A054007 A054008 * A054010 A054011 A054012

KEYWORD

nonn

AUTHOR

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

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 11:26 EDT 2019. Contains 328108 sequences. (Running on oeis4.)