login

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”).

A081217
Greatest squarefree number not exceeding n-th prime power.
7
1, 2, 3, 3, 5, 7, 7, 7, 11, 13, 15, 17, 19, 23, 23, 26, 29, 31, 31, 37, 41, 43, 47, 47, 53, 59, 61, 62, 67, 71, 73, 79, 79, 83, 89, 97, 101, 103, 107, 109, 113, 119, 123, 127, 127, 131, 137, 139, 149, 151, 157, 163, 167, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223
OFFSET
1,2
COMMENTS
a(n) = A070321(A000961(n)).
LINKS
MAPLE
n:= 0:
for m from 1 while n <= 100 do
if numtheory:-issqrfree(m) then s:= m fi;
if nops(numtheory:-factorset(m)) <= 1 then n:= n+1; A[n]:= s fi
od:
seq(A[i], i=1..100); # Robert Israel, Jan 08 2018
MATHEMATICA
nmax = 100; coeff = 5;
A000961 = Join[{1}, Select[Range[2, coeff*nmax], PrimePowerQ]];
a070321[n_] := For[k = n, True, k--, If[SquareFreeQ[k], Return[k]]];
a[n_] := If[n > Length[A000961], Print["error: increase insufficient coeff ", coeff], a070321[A000961[[n]] ] ];
Array[a, nmax] (* Jean-François Alcover, Mar 08 2019 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Mar 10 2003
STATUS
approved