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.

A133621 Numbers k such that binomial(k+p,k) mod k = 1, where p=10.

Original entry on oeis.org

3, 4, 11, 13, 17, 19, 23, 29, 31, 33, 37, 41, 43, 47, 53, 57, 59, 61, 67, 68, 71, 73, 79, 83, 85, 87, 89, 97, 101, 103, 107, 109, 111, 113, 121, 127, 131, 137, 139, 141, 143, 149, 151, 157, 163, 164, 167, 169, 173, 179, 181, 185, 187, 191, 193, 197, 199, 209, 211
Offset: 1

Views

Author

Hieronymus Fischer, Sep 30 2007

Keywords

Comments

All primes q > p are included, in that binomial(q+p,q) == (1+floor(p/q)) == 1 (mod q) holds for those primes.

Crossrefs

Programs

  • PARI
    isok(n) = ((binomial(n+10, n) % n) == 1) \\ Michel Marcus, Jul 15 2013