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!)
A160822 a(1)=2. For n >= 2, a(n) = smallest integer > a(n-1) such that omega(a(n)) = omega(a(n)-a(n-1)), where omega(m) = A001221(m). 3

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

%S 2,4,7,9,11,13,16,19,23,25,27,29,31,45,47,49,53,61,64,67,71,73,81,83,

%T 93,97,101,103,107,109,113,119,121,125,127,131,139,145,149,151,161,

%U 163,167,169,173,181,187,191,193,197,199,205,215,221,223,227,229,233,241,243

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

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

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

%Y Cf. A001221, 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 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)