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.

A349064 Numbers k such that A183097(k) > 2*k.

Original entry on oeis.org

144, 216, 288, 432, 576, 648, 864, 1152, 1296, 1600, 1728, 1944, 2000, 2304, 2592, 3200, 3456, 3600, 3888, 4000, 4608, 5000, 5184, 5400, 5488, 5832, 6272, 6400, 6912, 7056, 7200, 7776, 8000, 9000, 9216, 10000, 10368, 10584, 10800, 10976, 11664, 12544, 12800, 13500
Offset: 1

Views

Author

Amiram Eldar, Nov 07 2021

Keywords

Comments

The least odd term is a(934) = A349065(1) = 3472875.
Not all the terms are powerful. E.g., (prime(44)#)^3/4 and (prime(22)#)^6/32 are nonpowerful terms. What is the least nonpowerful term?

Examples

			144 is a term since A183097(144) = 290 > 2*144 = 288.
		

Crossrefs

Subsequence of A005101.
A349065 is a subsequence.

Programs

  • Mathematica
    f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - p; s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; q[n_] := s[n] > 2*n; Select[Range[15000], q]
  • PARI
    isok(k) = sumdiv(k, d, ispowerful(d)*d) > 2*k; \\ Michel Marcus, Nov 07 2021