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.

A228908 Primes of the form T(n) + S(n) + C(n) + 1 where T(n), S(n) and C(n) are the n-th triangular, square and cube numbers.

This page as a plain text file.
%I A228908 #34 Sep 24 2013 14:49:29
%S A228908 43,421,613,1951,7411,12973,23143,31249,48619,114073,210631,256033,
%T A228908 321403,365509,381061,502441,521641,669901,766039,791431,1015051,
%U A228908 1108693,1242271,1929751,2121793,2773471,3759991,3832999,4057681,5498329,7133281,7472011,7587259
%N A228908 Primes of the form T(n) + S(n) + C(n) + 1 where T(n), S(n) and C(n) are the n-th triangular, square and cube numbers.
%C A228908 Also primes of the form n^3 + 3/2*n^2 + 1/2*n + 1.
%H A228908 K. D. Bajpai, <a href="/A228908/b228908.txt">Table of n, a(n) for n = 1..10000</a>
%e A228908 a(3) = 613: T(8)+S(8)+C(8)+1 = 1/2*8*(8+1)+8^2+8^3+1 = 613 which is prime.
%e A228908 a(4) = 1951: T(12)+S(12)+C(12)+1 = 1/2*12*(12+1)+12^2+12^3+1 = 1951 which is prime.
%p A228908 KD:= proc() local a,b,c,d; a:= (1/2)*n*(n+1); b:=n^2; c:=n^3; d:=a+b+c+1; if isprime(d) then   RETURN(d): fi; end:seq(KD(),n=1..500);
%o A228908 (PARI) select(isprime, vector(100,n,n^3+3/2*n^2+n/2+1)) \\ _Charles R Greathouse IV_, Sep 15 2013
%Y A228908 Cf. A120479, A229080.
%K A228908 nonn
%O A228908 1,1
%A A228908 _K. D. Bajpai_, Sep 14 2013