|
|
A189883
|
|
Numbers n such that the square part of n is one greater than the squarefree part of n.
|
|
1
|
|
|
12, 240, 1260, 20592, 38220, 65280, 104652, 159600, 233772, 809100, 1047552, 1335180, 1678320, 2083692, 2558400, 3109932, 7308912, 8500140, 9831360, 11313132, 12956400, 18970380, 21376752, 24005100, 26868672, 37008972, 49780080
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The complementary sequence, squarefree part of n is one greater than the square part of n, is A069187.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
1260 = 2^2*3^2*5*7, square part: 2^2*3^2 = 36, squarefree part: 5*7 = 35, and 36 = 35+1.
|
|
MAPLE
|
b:= proc() 1 end:
a:= proc(n) option remember; local i, k;
if n>1 then a(n-1) fi;
for k from b(n-1)+1 while 1<>mul(i[2], i=ifactors(k^2-1)[2])
do od; b(n):=k; k^4-k^2
end:
|
|
MATHEMATICA
|
okQ[n_] := Module[{p, e, sfp}, {p, e} = Transpose[FactorInteger[n]]; e = Mod[e, 2]; sfp = Times @@ (p^e); n/sfp - sfp == 1]; Select[Range[10^5], okQ] (* T. D. Noe, Apr 29 2011 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|