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.

A360526 Odd numbers k such that A360522(k) > 2*k.

Original entry on oeis.org

15015, 19635, 21945, 23205, 25935, 26565, 31395, 33495, 33915, 35805, 39585, 41055, 42315, 42735, 45885, 47355, 49665, 50505, 51765, 54285, 55965, 58695, 61215, 64155, 68145, 70455, 72345, 77385, 80535, 82005, 83265, 84315, 91245, 95865, 102795, 112035, 116655
Offset: 1

Views

Author

Amiram Eldar, Feb 10 2023

Keywords

Comments

First differs from A112643, A129485, A249263 at n = 46: a(46) = 165165 is not a term of these sequences.

Examples

			15015 is a term since A360522(15015) = 32256 > 2*15015.
		

Crossrefs

Cf. A360522.
Subsequence of A005101, A005231 and A360525.

Programs

  • Mathematica
    f[p_, e_] := p^e + e; s[1] = 1; s[n_] := Times @@ f @@@ FactorInteger[n]; q[n_] := s[n] > 2*n; Select[Range[1, 10^5, 2], q]
  • PARI
    isab(n) = { my(f = factor(n)); prod(i = 1, #f~, f[i,1]^f[i,2] + f[i,2]) > 2*n;}
    is(n) = n%2 && isab(n);