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!)
A160650 a(n) = A001222(A160649(n)) = A160649(n+1) - A160649(n); where A001222(m) is the sum of prime-factorization exponents of m (or, A001222(m) is the number of primes dividing m, counted with multiplicity). 1
1, 1, 2, 2, 3, 1, 3, 2, 1, 3, 2, 1, 4, 3, 1, 5, 1, 2, 4, 3, 1, 5, 1, 4, 2, 4, 6, 3, 1, 2, 3, 1, 5, 2, 2, 1, 4, 2, 6, 3, 3, 5, 1, 3, 3, 5, 3, 7, 4, 1, 4, 6, 4, 3, 1, 2, 6, 2, 5, 1, 3, 2, 1, 5, 2, 2, 4, 1, 2, 4, 5, 2, 3, 4, 2, 6, 3, 4, 1, 3, 1, 4, 3, 1, 3, 3, 4, 5, 1, 3, 3, 5, 1, 5, 3, 2, 5, 3, 7, 2, 4, 2, 2, 2, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
CROSSREFS
Sequence in context: A190263 A144911 A233431 * A304092 A339669 A171691
KEYWORD
nonn
AUTHOR
Leroy Quet, May 21 2009
EXTENSIONS
Extended by Ray Chandler, Jun 16 2009
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 12 16:52 EDT 2024. Contains 372492 sequences. (Running on oeis4.)