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.

A114980 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=5 case.

Original entry on oeis.org

1, 3, 5, 7, 14, 15, 19, 20, 21, 23, 25, 26, 35, 45, 50, 55, 65, 73, 95, 105, 115, 119, 120, 125, 145, 165, 185, 195, 215, 225, 245, 270, 275, 285, 295, 305, 325, 350, 365, 385, 405, 425, 435, 437, 465, 495, 525, 527, 545, 585, 595, 605, 620, 621, 645
Offset: 1

Views

Author

Zak Seidov, Feb 22 2006

Keywords

Crossrefs

Programs

  • PARI
    isok(k, j=5) = (j^k+k^j) % (k+j) == 0; \\ Michel Marcus, Oct 10 2013
    
  • PARI
    isok(k, j=5) = Mod(j, k+j)^k+Mod(k, k+j)^j == 0; \\ Michel Marcus, Aug 07 2021

Extensions

More terms from Michel Marcus, Oct 10 2013