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.

A114978 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=3 case.

This page as a plain text file.
%I A114978 #15 Feb 10 2021 01:25:11
%S A114978 1,3,5,6,7,8,9,15,21,24,27,33,36,39,51,63,69,75,81,87,99,105,111,114,
%T A114978 118,123,135,153,165,171,183,207,213,219,231,243,249,255,267,279,309,
%U A114978 315,348,351,363,375,387,393,399,423,435,453,465,471,495,501
%N A114978 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=3 case.
%H A114978 Harvey P. Dale, <a href="/A114978/b114978.txt">Table of n, a(n) for n = 1..1000</a>
%t A114978 Select[Range[600],Divisible[3^#+#^3,#+3]&] (* _Harvey P. Dale_, Nov 26 2019 *)
%o A114978 (PARI) isok(k, j=3) = (j^k+k^j) % (k+j) == 0; \\ _Michel Marcus_, Oct 10 2013
%Y A114978 Cf. A114977, A114979, A114980, A114981.
%K A114978 nonn
%O A114978 1,2
%A A114978 _Zak Seidov_, Feb 22 2006
%E A114978 More terms from _Michel Marcus_, Oct 10 2013