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!)
 A160821 a(1)=2. a(n) = smallest positive integer such that omega(a(n)) = omega(sum{k=1 to n} a(k)), where omega(m) = A001221(m). 3
 2, 2, 3, 2, 2, 2, 3, 3, 4, 2, 2, 2, 2, 14, 2, 2, 4, 8, 3, 3, 4, 2, 8, 2, 10, 4, 4, 2, 4, 2, 4, 6, 2, 4, 2, 4, 8, 6, 4, 2, 10, 2, 4, 2, 4, 8, 6, 4, 2, 4, 2, 6, 10, 6, 2, 4, 2, 4, 8, 2, 6, 2, 5, 6, 6, 3, 20, 2, 6, 6, 2, 4, 2, 4, 6, 6, 2, 10, 2, 4, 2, 4, 8, 10, 2, 14, 2, 6, 2, 4, 6, 2, 6, 4, 2, 6, 4, 2, 12, 4, 8 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Sum{k=1 to n} a(k) = A160822(n). LINKS H. v. Eitzen, Table of n, a(n) for n=1,...,10000 CROSSREFS Cf. A001221, A160819, A160822. Sequence in context: A334216 A100549 A085962 * A300225 A060244 A072814 Adjacent sequences:  A160818 A160819 A160820 * A160822 A160823 A160824 KEYWORD nonn AUTHOR Leroy Quet, May 27 2009 EXTENSIONS Extended by Ray Chandler, Jun 15 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 July 26 17:37 EDT 2021. Contains 346294 sequences. (Running on oeis4.)