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.

A337385 Odd numbers k for which A003973(k) >= 2*A003961(k).

Original entry on oeis.org

334639305, 1003917915, 1265809545, 1353106755, 1673196525, 2109682575, 2255177925, 2342475135, 2553826275, 2691663975, 2729952225, 2953555605, 2982654675, 3011753745, 3128150025, 3157249095, 3234846615, 3258330075, 3419140725, 3442113675, 3681032355, 3797428635, 3855626775, 4059320265, 4292112825, 4350310965
Offset: 1

Views

Author

Antti Karttunen, Aug 31 2020

Keywords

Comments

Provided that there are no odd perfect numbers, then applying A003961 to each term and sorting into ascending order gives A115414.
Apparently, all terms are divisible by 255255 = 3*5*7*11*13*17. - Hugo Pfoertner, Sep 24 2020

Crossrefs

Subsequence of A337386.

Programs

  • PARI
    A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
    isA337385(n) = if(!(n%2),0,my(x=A003961(n)); (sigma(x)>=2*x));