login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076360 a(n) = d0(d1(w)) - d1(d0(w)), where d0()=number of divisors, d1()=sum of divisors. 6
0, -1, 0, -2, 1, -1, 1, -3, -2, -1, 3, -6, 1, 1, 1, -4, 3, -8, 3, -4, -1, 2, 5, -3, -2, 1, 1, -4, 5, -3, 3, -6, 3, 1, 3, -9, 1, 5, 1, -3, 5, -3, 3, 0, -4, 5, 7, -12, 0, -8, 5, -6, 5, 1, 5, 1, 3, 5, 9, -12, 1, 5, -4, -6, 5, 0, 3, 0, 5, 0, 9, -20, 1, 1, -6, 0, 5, 1, 7, -10, -3, 5, 9, -16, 5, 5, 9, 3, 9, -16, 3, 4, 1, 8, 9, -10, 3, -6, 0, -9, 5, 1, 5, 1, -1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
MATHEMATICA
d0[x_] := DivisorSigma[0, x]
d1[x_] := DivisorSigma[1, x]
Table[ d0[d1[w]] - d1[d0[w] ], {w, 1, 128}]
CROSSREFS
Sequence in context: A262766 A262747 A016442 * A246702 A089398 A345272
KEYWORD
easy,sign
AUTHOR
Labos Elemer, Oct 08 2002
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)