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!)
A160512 a(1)=1. a(2n) = the smallest power of a prime > a(2n-1). a(2n+1) = the smallest squarefree integer > a(2n). 0

%I

%S 1,2,3,4,5,7,10,11,13,16,17,19,21,23,26,27,29,31,33,37,38,41,42,43,46,

%T 47,51,53,55,59,61,64,65,67,69,71,73,79,82,83,85,89,91,97,101,103,105,

%U 107,109,113,114,121,122,125,127,128,129,131,133,137,138,139,141,149

%N a(1)=1. a(2n) = the smallest power of a prime > a(2n-1). a(2n+1) = the smallest squarefree integer > a(2n).

%C The sequence b(1)=1; b(2n) = the smallest squarefree integer > b(2n-1); b(2n+1) = the smallest power of a prime > b(2n), is such that: b(1)=a(1), b(2)=a(2), b(3)=a(3). And, b(n) = a(n+1), for n >= 4. (Ie The sequences are the same except that the integer 4 is excluded from {b(k)}, and except for the indexing after the 3rd term of each sequence.)

%K nonn

%O 1,2

%A _Leroy Quet_, May 16 2009

%E Extended by _Ray Chandler_, Jun 16 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 May 25 22:51 EDT 2022. Contains 354073 sequences. (Running on oeis4.)