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.

This page as a plain text file.
%I A114979 #16 Feb 10 2021 01:24:56
%S A114979 1,4,12,25,28,30,60,61,109,124,252,478,529,1024,3273,6172,14881,24700,
%T A114979 28732,29701,32509,41437,47569,70009,83209,86629,88177,99712,131161,
%U A114979 161473,172092,224389,280869,281509,419017,640129,691840,704089,983641,1048588
%N A114979 Numbers n such that (j^k + k^j) == 0 (mod k+j), j=4 case.
%C A114979 a(755) > 10^11. - _Hiroaki Yamanouchi_, Sep 26 2015
%H A114979 Hiroaki Yamanouchi, <a href="/A114979/b114979.txt">Table of n, a(n) for n = 1..754</a>
%o A114979 (PARI) isok(k, j=4) = (j^k+k^j) % (k+j) == 0; \\ _Michel Marcus_, Oct 10 2013
%Y A114979 Cf. A114977, A114978, A114980, A114981.
%K A114979 nonn
%O A114979 1,2
%A A114979 _Zak Seidov_, Feb 22 2006
%E A114979 a(11)-a(28) from _Michel Marcus_, Oct 10 2013
%E A114979 a(29)-a(40) from _Hiroaki Yamanouchi_, Sep 26 2015