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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160649 a(1)=2. a(n) = a(n-1) + A001222(a(n-1)); where A001222(m) is the sum of prime-factorization exponents of m (or, A001222(m) is the number of primes dividing m, with multiplicity). 3
2, 3, 4, 6, 8, 11, 12, 15, 17, 18, 21, 23, 24, 28, 31, 32, 37, 38, 40, 44, 47, 48, 53, 54, 58, 60, 64, 70, 73, 74, 76, 79, 80, 85, 87, 89, 90, 94, 96, 102, 105, 108, 113, 114, 117, 120, 125, 128, 135, 139, 140, 144, 150, 154, 157, 158, 160, 166, 168, 173, 174, 177, 179 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A001222(a(n)) = A160650(n) = a(n+1) - a(n).

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..10000

MATHEMATICA

NestList[# + PrimeOmega[#] &, 2, 100] (* Zak Seidov, Feb 15 2015 *)

PROG

(PARI) lista(nn) = {print1(a=2, ", "); for (n=2, nn, a += bigomega(a); print1(a, ", "); ); } \\ Michel Marcus, May 04 2018

CROSSREFS

Cf. A001222, A160650.

Sequence in context: A123586 A257121 A039500 * A341059 A190203 A034034

Adjacent sequences:  A160646 A160647 A160648 * A160650 A160651 A160652

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 18 18:17 EDT 2021. Contains 345120 sequences. (Running on oeis4.)