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.
%I A126112 #17 Sep 19 2024 04:17:50
%S A126112 3,7,11,29,31,53,59,83,109,127,283,349,461,521,599,643,683,787,809,
%T A126112 829,907,911,937,983,1093,1117,1201,1289,1301,1487,1523,1613,1721,
%U A126112 1877,2017,2153,2267,2281,2423,2521,2579,2657,2677,2699,2731,2741,2797,2887,2969
%N A126112 Prime numbers p such that p^4 + (p-1)^4 + (p+1)^4 is a prime number.
%H A126112 Harvey P. Dale, <a href="/A126112/b126112.txt">Table of n, a(n) for n = 1..1000</a>
%e A126112 (3-1)^4 + 3^4 + (3+1)^4 = 2^4 + 3^4 + 4^4 = 16 + 81 + 256 = 353 is prime, hence 3 is a term.
%e A126112 (11-1)^4 + 11^4 + (11+1)^4 = 10^4 + 11^4 + 12^4 = 10000 + 14641 + 20736 = 45377 is prime, hence 11 is a term.
%t A126112 f[n_]:=PrimeQ[(n-1)^4+n^4+(n+1)^4];lst={};Do[p=Prime[n];If[f[p],AppendTo[lst,p]],{n,7!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Oct 27 2009 *)
%t A126112 Select[Prime[Range[500]],PrimeQ[Total[(#+{-1,0,1})^4]]&] (* _Harvey P. Dale_, Dec 07 2012 *)
%o A126112 (PARI) forprime(p=2, 3000, if(isprime(q=(p-1)^4+p^4+(p+1)^4), print1(p, ","))) /* _Klaus Brockhaus_, Mar 09 2007 */
%Y A126112 Cf. A126657, A126769, A126113.
%K A126112 nonn
%O A126112 1,1
%A A126112 _Tomas Xordan_, Mar 05 2007
%E A126112 Edited, corrected and extended by _Klaus Brockhaus_, Mar 09 2007