cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A332979 Largest integer m satisfying Omega(m) + pi(gpf(m)) - [m<>1] = n.

Original entry on oeis.org

1, 2, 4, 9, 27, 125, 625, 3125, 16807, 161051, 1771561, 19487171, 214358881, 2357947691, 25937424601, 285311670611, 3138428376721, 34522712143931, 582622237229761, 9904578032905937, 168377826559400929, 2862423051509815793, 48661191875666868481
Offset: 0

Views

Author

Alois P. Heinz, Mar 04 2020

Keywords

Comments

From Michael De Vlieger, Aug 22 2022: (Start)
Subset of A000961.
Maxima of row n of A005940.
Maxima of row n of A182944 and row n of A182945. (End)

Crossrefs

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

Programs

  • 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 *)
    (* 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 *)

Formula

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