

A160512


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


0



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, 47, 51, 53, 55, 59, 61, 64, 65, 67, 69, 71, 73, 79, 82, 83, 85, 89, 91, 97, 101, 103, 105, 107, 109, 113, 114, 121, 122, 125, 127, 128, 129, 131, 133, 137, 138, 139, 141, 149
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

The sequence b(1)=1; b(2n) = the smallest squarefree integer > b(2n1); 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.)


LINKS

Table of n, a(n) for n=1..64.


CROSSREFS

Sequence in context: A123091 A191918 A191925 * A144430 A337382 A348253
Adjacent sequences: A160509 A160510 A160511 * A160513 A160514 A160515


KEYWORD

nonn


AUTHOR

Leroy Quet, May 16 2009


EXTENSIONS

Extended by Ray Chandler, Jun 16 2009


STATUS

approved



