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!)
A160820 a(1)=2. For n >=2, a(n) = smallest positive integer > a(n-1) such that Omega(a(n)) = Omega(a(n)-a(n-1)), where Omega(m) = A001222(m). 3

%I #10 Jan 29 2016 11:11:17

%S 2,5,7,21,23,33,39,41,43,49,55,63,69,71,73,77,79,85,91,95,97,105,107,

%T 109,115,119,123,129,131,141,145,153,159,169,178,181,185,194,197,199,

%U 203,209,211,215,219,231,233,237,239,241,247,253,259,265,273,285,289

%N a(1)=2. For n >=2, a(n) = smallest positive integer > a(n-1) such that Omega(a(n)) = Omega(a(n)-a(n-1)), where Omega(m) = A001222(m).

%C For n>=2, a(n)-a(n-1) = A160819(n).

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)