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.

A233344 Numbers k that divide the sum of their remainders modulo all smaller composites (=A233131(k)).

Original entry on oeis.org

1, 2, 3, 4, 23, 53, 374, 613, 225460, 490537, 1748155, 3167982, 9266618, 12543856, 12589961, 27359852, 3418801560, 8824909730, 72988555402
Offset: 1

Views

Author

Max Alekseyev, Dec 07 2013

Keywords

Comments

The prime terms are given by A143853.

Crossrefs

Programs

  • PARI
    s=0; pp=0; for(n=2,10^8, p=factor(n)[,1]; s += (n-2) - pp - sigma(n) +  sum(i=1,#p,p[i]) + if(!ispseudoprime(n),n,pp++;0) + 1; if(s%n==0,print1(n,", ")) )