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.

A307950 Primes that are the sum of two prime-indexed triangular numbers.

This page as a plain text file.
%I A307950 #15 May 07 2019 21:01:01
%S A307950 31,43,97,157,181,193,281,367,463,499,587,709,769,1051,1381,1459,1621,
%T A307950 1831,1861,2081,2281,2293,2377,2473,2647,2707,2713,2729,2767,2837,
%U A307950 3019,3163,3251,3259,3313,3709,3863,4021,4447,4591,4759,4943,4951,5051,5179,5647,5791,5861,5869,5881,6217,6271
%N A307950 Primes that are the sum of two prime-indexed triangular numbers.
%C A307950 Primes of the form A034953(i) + A034953(j).
%C A307950 There are primes with more than one expression of this form; e.g., 18749 = A034953(4) + A034953(44) = A034953(19) + A034953(42).
%H A307950 Robert Israel, <a href="/A307950/b307950.txt">Table of n, a(n) for n = 1..10000</a>
%e A307950 a(3) = 97 is a term because 97 = 6 + 91 is prime where 6=A000217(3) and 91=A000217(13) are in A034953.
%p A307950 A034953:= map(t ->t*(t+1)/2, [seq(ithprime(i),i=1..100)]):
%p A307950 A:= select(t -> t <= A034953[-1]+3 and isprime(t), {seq(seq(A034953[i]+A034953[j],j=i+1..100),i=1..99)}):
%p A307950 sort(convert(A,list));
%Y A307950 Cf. A000217, A034953, A117112.
%K A307950 nonn
%O A307950 1,1
%A A307950 _J. M. Bergot_ and _Robert Israel_, May 07 2019