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.

A385653 Least k such that A385652(k) = n.

Original entry on oeis.org

2, 4, 8, 12, 18, 24, 27, 36, 48, 54, 72, 80, 90, 100, 120, 125, 135, 150, 160, 180, 196, 210, 224, 245, 252, 280, 294, 315, 336, 343, 350, 378, 392, 420, 441, 448, 490, 504, 525, 560, 567, 588, 630, 672, 686, 700, 735, 756, 784, 840, 875, 882, 896, 945, 980
Offset: 1

Views

Author

Pontus von Brömssen, Jul 06 2025

Keywords

Comments

A385654(n) is uniquely popular on the interval [2,a(n)]; see A289662.
Equivalently, a(n) is the least k >= 2 such that A078899(k) = n.

Crossrefs

Programs

  • PARI
    gpf(n) = if (n==1,1, vecmax(factor(n)[,1])); \\ A006530
    f(n) = my(v=vector(n, k, gpf(k)), s=Set(v)); vecmax(apply(x->#x, vector(#s, i, select(x->(x==s[i]), v)))); \\ A385652
    a(n) = my(k=2); while (f(k) !=n, k++); k; \\ Michel Marcus, Jul 06 2025