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.

A114981 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=6 case.

This page as a plain text file.
%I A114981 #17 Aug 07 2021 21:33:36
%S A114981 1,3,6,10,12,15,18,21,26,30,42,48,57,58,62,66,68,71,72,75,87,90,102,
%T A114981 138,156,183,186,210,216,228,237,273,282,291,318,426,476,480,561,570,
%U A114981 576,606,642,645,660,696,701,723,831,858,951,966,1290,1306,1452
%N A114981 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=6 case.
%H A114981 Seiichi Manyama, <a href="/A114981/b114981.txt">Table of n, a(n) for n = 1..500</a>
%o A114981 (PARI) isok(k, j=6) = (j^k+k^j) % (k+j) == 0; \\ _Michel Marcus_, Oct 10 2013
%o A114981 (PARI) isok(k, j=6) = Mod(j, k+j)^k+Mod(k, k+j)^j == 0; \\ _Michel Marcus_, Aug 07 2021
%Y A114981 Cf. A114977, A114978, A114979, A114980.
%K A114981 nonn
%O A114981 1,2
%A A114981 _Zak Seidov_, Feb 22 2006
%E A114981 More terms from _Michel Marcus_, Oct 10 2013