The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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 Cf. A001222, A160649. Sequence in context: A190263 A144911 A233431 * A304092 A171691 A088904 Adjacent sequences:  A160647 A160648 A160649 * A160651 A160652 A160653 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 09:48 EDT 2020. Contains 334698 sequences. (Running on oeis4.)