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!)
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

%I

%S 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,

%T 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,

%U 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

%N 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).

%C Sum{k=1 to n} a(k) = A160822(n).

%H H. v. Eitzen, <a href="/A160821/b160821.txt">Table of n, a(n) for n=1,...,10000</a>

%Y Cf. A001221, A160819, A160822.

%K nonn

%O 1,1

%A _Leroy Quet_, May 27 2009

%E Extended by _Ray Chandler_, Jun 15 2009

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 September 28 03:16 EDT 2021. Contains 347698 sequences. (Running on oeis4.)