|
|
A322293
|
|
Integers k such that A322292(k) <= k.
|
|
2
|
|
|
6, 8, 12, 14, 18, 20, 24, 30, 32, 42, 44, 48, 60, 62, 72, 74, 84, 90, 102, 104, 108, 110, 114, 132, 140, 168, 182, 198, 200, 234, 240, 242, 270, 272, 282, 284, 312, 314, 318, 354, 360, 390, 420, 422, 434, 462, 464, 468, 510, 572, 648, 660, 662, 762, 840, 884, 888, 942, 1064
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Erdos conjectures that this sequence is finite.
|
|
LINKS
|
|
|
MAPLE
|
N:= 10^6: # to get all terms <= N
Res:= 6: v:= 6:
for n from 7 to N do
if not isprime(n-1) then v:= max(v, n-1 + min(numtheory:-factorset(n-1))) fi;
if v <= n then Res:= Res, n fi;
od:
|
|
MATHEMATICA
|
f[n_] := Module[{smax = 0}, Do[If[CompositeQ[m], smax = Max[smax, m + FactorInteger[m][[1, 1]]]], {m, 2, n-1}]; smax]; aQ[n_] := f[n]<=n; Select[Range[6, 1000], aQ] (* Amiram Eldar, Dec 02 2018 *)
|
|
PROG
|
(PARI) f(n) = {my(smax = 0); forcomposite(m=1, n-1, smax = max(smax, m + factor(m)[1, 1]); ); smax; } \\ A322292
isok(n) = f(n) <= n;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|