|
%I #46 May 16 2021 18:13:21
%S 36,78,120,210,276,300,630,946,990,1770,1830,2556,2850,3240,3570,4278,
%T 4950,5460,8256,9870,10878,11026,12090,12720,20100,20910,23436,26796,
%U 31626,34980,41616,43660,46056,55278,56616,57630,59340,66066,73920
%N Triangular numbers that are sums of two consecutive primes.
%C Intersection of A000217 and A001043. - _Michel Marcus_, May 18 2015
%H Chai Wah Wu, <a href="/A111163/b111163.txt">Table of n, a(n) for n = 1..10000</a> (n = 1..472 from K. D. Bajpai, n = 473..1000 from T. D. Noe)
%e 36 = 8(8+1)/2 = 17 + 19. Therefore 36 belongs to the sequence.
%p P:=proc()local i,a,b,c;c:=1;for i from 1 to 1200000 do;
%p a:=ithprime(i)+ithprime(i+1);b:=(-1+(sqrt(8*a+1)))/2;
%p if b=floor(b) then lprint(c,a);c:=c+1;fi; od;end:P();
%p # _K. D. Bajpai_, Jun 30 2013
%t Select[Table[Prime[n] + Prime[n + 1], {n, 4500}], IntegerQ[Sqrt[1 + 8# ]] &] (* _Ray Chandler_, Oct 22 2005 *)
%t t = {}; n = 0; While[Length[t] < 100, n++; s = Prime[n] + Prime[n + 1]; If[TriangularQ[s], AppendTo[t, s]]]; t (* _T. D. Noe_, Jun 30 2013 *)
%o (PARI) {p=2; ct=0; while(ct<66, q=nextprime(p+1); s=p+q; if( issquare(8*s+1), print1(s, ", "); ct++); p=q)} \\ _Klaus Brockhaus_, Oct 22 2005
%o (Python)
%o from sympy import nextprime as np
%o from sympy import prevprime as pp
%o n=1
%o t=n*(n+1)//2
%o while t>0:
%o ....if t%2==0 and t>3:
%o ........i=int(t//2)
%o ........p=pp(i); q=np(p)
%o ........if p+q==t :
%o ............print(int(t))
%o ....n=n+1
%o ....t=n*(n+1)//2 # _Abhiram R Devesh_, May 17 2015
%o (Python)
%o from __future__ import division
%o from sympy import prevprime,nextprime,isprime
%o A111163_list = [n*(n+1)//2 for n in range(3,10**4) if not isprime(n*(n+1)//4) and prevprime(n*(n+1)//4)+nextprime(n*(n+1)//4) == n*(n+1)//2] # _Chai Wah Wu_, Feb 11 2018
%Y Cf. A000217 (triangular numbers), A001043 (sums of consecutive primes).
%K nonn
%O 1,1
%A _Joseph L. Pe_, Oct 20 2005
%E Extended by _Ray Chandler_ and _Klaus Brockhaus_, Oct 22 2005
|
