A162900 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A162900

a(1)=1. For n >= 2, a(n) is the smallest integer > a(n-1) such that gcd(n, a(n)) = p^k, where p is a prime, k >= 1.

1, 2, 3, 4, 5, 8, 14, 16, 18, 22, 33, 34, 39, 40, 42, 44, 51, 52, 57, 58, 60, 62, 69, 70, 75, 76, 78, 80, 87, 88, 93, 94, 96, 98, 100, 104, 111, 112, 114, 115, 123, 124, 129, 130, 132, 134, 141, 142, 147, 148, 150, 152, 159, 160, 170, 172, 174, 176, 177, 178, 183, 184

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

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

CROSSREFS

Cf. A162901.

Sequence in context: A330706 A162901 A333785 * A015925 A140294 A108014

Adjacent sequences: A162897 A162898 A162899 * A162901 A162902 A162903

KEYWORD

nonn

AUTHOR

Leroy Quet, Jul 16 2009

EXTENSIONS

More terms from Max Alekseyev, Feb 06 2010

STATUS

approved