login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A332979 Largest integer m satisfying Omega(m) + pi(gpf(m)) - [m<>1] = n. 3
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

LINKS

Alois P. Heinz, Table of n, a(n) for n = 0..461

Wikipedia, Iverson bracket

FORMULA

a(n) = A332977(A011782(n)).

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];

a /@ Range[0, 23] (* Jean-Fran├žois Alcover, May 03 2021, after Alois P. Heinz *)

CROSSREFS

Cf. A000720 (pi), A001222 (Omega), A006530 (GPF), A011782, A060576 ([n<>1]), A061395 (pi(gpf(n))), A332977.

Sequence in context: A003320 A007876 A343845 * A176068 A296264 A343166

Adjacent sequences:  A332976 A332977 A332978 * A332980 A332981 A332982

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Mar 04 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 2 01:19 EDT 2021. Contains 346408 sequences. (Running on oeis4.)