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 A229960 #11 Oct 06 2013 15:19:28
%S A229960 53,109,683,4759,7789,9029,13523,15299,45989,63179,68059,90089,116423,
%T A229960 174019,225089,370619,610469,700963,994949,1025149,1119403,1398599,
%U A229960 1594709,1898873,2291189,2561899,2734129,2975543,3038039,3296773,3784169,3857489,5913269,6212483
%N A229960 Primes of the form n^3 - T(n) - 1 where T(n) is the n-th triangular number.
%C A229960 Also primes of the form (2*n^3 - n^2 - n - 2)/2.
%H A229960 K. D. Bajpai, <a href="/A229960/b229960.txt">Table of n, a(n) for n = 1..10000</a>
%e A229960 a(2) = 109 since 5^3 - T(5) - 1 = 125 - 15 - 1 = 109, which is prime.
%e A229960 a(6) = 9029 since 21^3 - T(21) - 1 = 9261 - 231 - 1 = 9029 which is prime.
%p A229960 KD:= proc() local a,b,d; a:= n^3;b:=(1/2)*n*(n+1); d:=a-b-1; if isprime(d) then RETURN(d): fi;end: seq(KD(),n=1..500);
%t A229960 Select[Table[(n^3) - (n/2*(n + 1)) - 1, {n, 200}], PrimeQ]
%Y A229960 Cf. A229157, A229080.
%K A229960 nonn,less
%O A229960 1,1
%A A229960 _K. D. Bajpai_, Oct 04 2013