login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A160819 a(1)=2. a(n) = smallest positive integer such that Omega(a(n)) = Omega(sum{k=1 to n} a(k)), where Omega(m) = A001222(m). 3
2, 3, 2, 14, 2, 10, 6, 2, 2, 6, 6, 8, 6, 2, 2, 4, 2, 6, 6, 4, 2, 8, 2, 2, 6, 4, 4, 6, 2, 10, 4, 8, 6, 10, 9, 3, 4, 9, 3, 2, 4, 6, 2, 4, 4, 12, 2, 4, 2, 2, 6, 6, 6, 6, 8, 12, 4, 6, 4, 4, 6, 2, 2, 6, 4, 4, 14, 14, 6, 4, 2, 4, 2, 4, 2, 8, 2, 4, 10, 4, 2, 4, 4, 2, 2, 6, 8, 10, 6, 15, 8, 4, 4, 5, 6, 4, 2, 6, 6 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

sum{k=1 to n} a(k) = A160820(n).

LINKS

H. v. Eitzen, Table of n, a(n) for n=1,...,10000

CROSSREFS

Cf. A001222, A160820, A160821.

Sequence in context: A083775 A083784 A177048 * A205441 A181350 A174111

Adjacent sequences:  A160816 A160817 A160818 * A160820 A160821 A160822

KEYWORD

nonn

AUTHOR

Leroy Quet, May 27 2009

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jun 15 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 03:30 EST 2012. Contains 205978 sequences.