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.

A351075 Numbers k such that the maximal exponent in the prime factorization of A327860(k) is less than A051903(k), the maximal exponent in the prime factorization of k.

Original entry on oeis.org

2, 4, 6, 9, 12, 30, 32, 40, 48, 60, 63, 64, 68, 75, 76, 81, 96, 104, 108, 112, 128, 160, 192, 210, 212, 220, 224, 225, 240, 242, 243, 245, 248, 250, 256, 270, 272, 275, 276, 279, 280, 284, 288, 304, 312, 320, 324, 336, 352, 384, 420, 423, 424, 425, 428, 436, 448, 456, 459, 464, 472, 480, 484, 486, 488, 490, 492, 495, 496
Offset: 1

Views

Author

Antti Karttunen, Feb 01 2022

Keywords

Comments

Numbers k for which A328391(k) < A051903(k).

Crossrefs

Cf. A003415, A276086, A051903, A327860, A328391, A351076 (complement), A351077 (and its characteristic function).
Positions of negative terms in A351074.
Subsequence of A351038.
Cf. also A350075.

Programs

  • PARI
    A051903(n) = if((1==n),0,vecmax(factor(n)[, 2]));
    A327860(n) = { my(s=0, m=1, p=2, e); while(n, e = (n%p); m *= (p^e); s += (e/p); n = n\p; p = nextprime(1+p)); (s*m); };
    isA351075(n) = (A051903(A327860(n)) < A051903(n));