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!)
A061069 Number of distinct values in the list of divisor-sums {sigma(j) : j=1...n}. 2
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 10, 11, 12, 13, 13, 14, 14, 15, 16, 17, 18, 19, 19, 20, 20, 20, 21, 22, 23, 24, 24, 25, 26, 27, 27, 28, 29, 29, 29, 30, 30, 31, 32, 33, 34, 34, 34, 35, 36, 37, 37, 38, 38, 39, 39, 39, 40, 40, 40, 41, 42, 42, 43, 44, 44, 45, 46, 47, 47, 47, 47, 48 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n)=Length[Union[Table[DivisorSigma[1, w], {w, 1, n}]]]
PROG
(Python)
from sympy import divisor_sigma
def A061069(n): return len({divisor_sigma(i) for i in range(1, n+1)}) # Chai Wah Wu, Sep 08 2023
CROSSREFS
Cf. A000203.
Sequence in context: A100470 A071604 A337769 * A122256 A122262 A172268
KEYWORD
nonn
AUTHOR
Labos Elemer, May 28 2001
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 June 28 10:15 EDT 2024. Contains 373780 sequences. (Running on oeis4.)