Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152770
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152770 Sum of proper divisors minus the number of proper divisors of n: a(n) = sigma(n) - n - d(n) + 1. +0
22
0, 0, 0, 1, 0, 3, 0, 4, 2, 5, 0, 11, 0, 7, 6, 11, 0, 16, 0, 17, 8, 11, 0, 29, 4, 13, 10, 23, 0, 35, 0, 26, 12, 17, 10, 47, 0, 19, 14, 43, 0, 47, 0, 35, 28, 23, 0, 67, 6, 38, 18, 41, 0, 59, 14, 57, 20, 29, 0, 97, 0, 31, 36, 57, 16, 71, 0, 53, 24, 67, 0, 112, 0, 37, 44, 59, 16, 83, 0, 97 (list; graph; listen)
OFFSET

1,6

COMMENT

Sum of divisors of n, minus the number of divisors of n, minus n, plus 1.

Also, sum of proper divisors of n, minus the number of divisors of n, plus 1.

Note that if a(n)>0 then n is a composite number (A002808), otherwise, n is a non-composite number (A008578) also called prime number at the beginning of the 20th century.

Also, sum of divisors of n, minus the number of proper divisors of n, minus n. [From Omar E. Pol (info(AT)polprimos.com), Dec 14 2008]

a(A008578)==0. [From Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 14 2008]

FORMULA

a(n) = A000203(n)-A000005(n)-n+1 = A001065(n)-A000005(n)+1 = A000203(n)-A062249(n)+1 = A065608(n)-n+1.

a(n) = A000203(n)-A032741(n)-n. [From Omar E. Pol (info(AT)polprimos.com), Dec 14 2008]

a(n) = A001065(n)-A032741(n). [From Omar E. Pol (info(AT)polprimos.com), Dec 15 2008]

a(n)= A158901(n)-A000027(n). [From Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Sep 12 2009]

MATHEMATICA

f[n_] := DivisorSigma[1, n] - DivisorSigma[0, n] - n + 1; Array[f, 105] [From Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 14 2008]

CROSSREFS

A000005, A000040, A000203, A001065, A002808, A008578, A062249, A065608.

Cf. A032741. [From Omar E. Pol (info(AT)polprimos.com), Dec 14 2008]

Sequence in context: A081170 A077150 A065453 this_sequence A098601 A113486 A108572

Adjacent sequences: A152767 A152768 A152769 this_sequence A152771 A152772 A152773

KEYWORD

easy,nonn

AUTHOR

Omar E. Pol (info(AT)polprimos.com), Dec 12 2008

EXTENSIONS

More term from Omar E. Pol (info(AT)polprimos.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 14 2008

Definition clarified and edited by Omar E. Pol (info(AT)polprimos.com), Dec 21 2008

page 1

Search completed in 0.003 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 December 6 19:58 EST 2009. Contains 170429 sequences.


AT&T Labs Research