|
|
A332979
|
|
Largest integer m satisfying Omega(m) + pi(gpf(m)) - [m<>1] = n.
|
|
6
|
|
|
1, 2, 4, 9, 27, 125, 625, 3125, 16807, 161051, 1771561, 19487171, 214358881, 2357947691, 25937424601, 285311670611, 3138428376721, 34522712143931, 582622237229761, 9904578032905937, 168377826559400929, 2862423051509815793, 48661191875666868481
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
Michael De Vlieger, Concise table of n, a(n) for n = 1..10000, where a(n) = prime(k)^e written as "pk^e". (a(0) = 1 is presented as "p1^0" to avoid reconversion errors in some CAS associated with "prime(0)".)
Michael De Vlieger, Fan style binary tree showing row m = 2..15 of A005940 in concentric semicircles. Terms in light blue appear in row m-1 of A182944, highlighting a(m-1) in red.
Michael De Vlieger, Fan style binary tree showing row m = 2..15 of A005940 in concentric semicircles. We apply a color function with dark blue the minimum and greens the largest values to show the magnitude of terms in row m compared to 2^(m-1). The row maximum a(m-1) appears in red.
|
|
FORMULA
|
|
|
MAPLE
|
b:= proc(n, i) option remember; `if`(n=0, 1, max(seq(b(n-
`if`(i=0, j, 1), j)*ithprime(j), j=1..`if`(i=0, n, i))))
end:
a:= n-> b(n, 0):
seq(a(n), n=0..23);
|
|
MATHEMATICA
|
b[n_, i_] := b[n, i] = If[n == 0, 1, Max[Table[
b[n - If[i == 0, j, 1], j] Prime[j], {j, 1, If[i == 0, n, i]}]]];
a[n_] := b[n, 0];
(* Second program: extract data from the concise a-file of 10000 terms: *)
With[{nn = 23 (* set nn <= 10000 as desired *)}, Prime[#1]^#2 & @@ # & /@ Map[ToExpression /@ {StringTrim[#1, "p"], #2} & @@ StringSplit[#, "^"] &, Import["https://oeis.org/A332979/a332979.txt", "Data"][[1 ;; nn, -1]] ] ] (* Michael De Vlieger, Aug 22 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|