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.

A114979 Numbers n such that (j^k + k^j) == 0 (mod k+j), j=4 case.

Original entry on oeis.org

1, 4, 12, 25, 28, 30, 60, 61, 109, 124, 252, 478, 529, 1024, 3273, 6172, 14881, 24700, 28732, 29701, 32509, 41437, 47569, 70009, 83209, 86629, 88177, 99712, 131161, 161473, 172092, 224389, 280869, 281509, 419017, 640129, 691840, 704089, 983641, 1048588
Offset: 1

Views

Author

Zak Seidov, Feb 22 2006

Keywords

Comments

a(755) > 10^11. - Hiroaki Yamanouchi, Sep 26 2015

Crossrefs

Programs

  • PARI
    isok(k, j=4) = (j^k+k^j) % (k+j) == 0; \\ Michel Marcus, Oct 10 2013

Extensions

a(11)-a(28) from Michel Marcus, Oct 10 2013
a(29)-a(40) from Hiroaki Yamanouchi, Sep 26 2015