The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A185166 Number of prime divisors of n (counted with multiplicity) of numbers k such that sum of proper divisors of k exceeds that of all smaller numbers. 1
0, 1, 2, 2, 3, 2, 3, 3, 3, 4, 3, 4, 5, 4, 5, 4, 4, 6, 5, 5, 6, 5, 5, 6, 6, 7, 5, 6, 6, 5, 7, 6, 6, 6, 5, 7, 6, 8, 7, 7, 7, 6, 8, 6, 7, 6, 6, 8, 6, 8, 7, 9, 7, 8, 8, 8, 7, 7, 7, 9, 6, 7, 8, 7, 7, 7, 9, 9, 8, 8, 7, 9, 7, 8, 8, 8, 7, 9, 7, 9, 8, 8, 10, 8, 9, 9, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..1000 (calculated from the b-file at A034090)
FORMULA
a(n) = A001222(A034090(n)).
EXAMPLE
a(1) = 0 because 1 = A034090(1) has no prime factors.
a(2) = 1 because 2 = A034090(2) has one prime factor, itself.
a(3) = 2 because 4 = A034090(3) = 2^2 has two prime factors (with multiplicity).
CROSSREFS
Sequence in context: A338292 A359728 A217865 * A276555 A348190 A211100
KEYWORD
nonn
AUTHOR
Jonathan Vos Post, Feb 19 2011
EXTENSIONS
More terms from Amiram Eldar, Aug 30 2019
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 May 20 21:47 EDT 2024. Contains 372720 sequences. (Running on oeis4.)