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

1, 2, 3, 4, 5, 8, 14, 14, 15, 15, 22, 22, 26, 26, 27, 28, 34, 34, 38, 38, 39, 40, 46, 46, 50, 50, 51, 52, 58, 58, 62, 62, 63, 64, 65, 68, 74, 74, 75, 75, 82, 82, 86, 86, 87, 88, 94, 94, 98, 98, 99, 100, 106, 106, 115, 116, 117, 118, 118, 118, 122, 122, 123, 124, 125, 128

Offset

1,2

Links

Robert Israel, Table of n, a(n) for n = 1..10000

Maple

f:= proc(n) option remember; local r;
      for r from procname(n-1) do
        if nops(ifactors(igcd(n, r))[2])=1 then return r fi
     od
end proc:
f(1):= 1:
map(f, [$1..100]); # Robert Israel, Jun 27 2019

Prog

(PARI) a=1; print1(a, ", "); for(n=2, 100, while(omega(gcd(n, a))!=1, a++); print1(a, ", ")) \\ Hagen von Eitzen, Oct 03 2009

Crossrefs

Cf. A162900.

Sequence in context: A357533 A152526 A330706 * A333785 A162900 A015925

Adjacent sequences: A162898 A162899 A162900 * A162902 A162903 A162904

Keyword

nonn

Author

Leroy Quet, Jul 16 2009

Extensions

More terms from Hagen von Eitzen, Oct 03 2009

Status

approved