login
The OEIS is supported by the many generous donors 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

%I #8 Mar 11 2014 01:32:30

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

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

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

%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) = A001222(m).

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

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

%Y Cf. A001222, A160820, A160821.

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:06 EDT 2024. Contains 371781 sequences. (Running on oeis4.)