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 A082669 #11 Aug 23 2024 23:21:35
%S A082669 10,21,78,171,465,903,1830,2628,5253,5886,9591,11325,16290,18528,
%T A082669 19701,26106,28920,36585,39903,48828,60726,88410,93528,106953,136503,
%U A082669 162735,180300,191271,206403,218130,328455,338253,343206,368511,389403
%N A082669 Let p(n) = upper member of n-th pair of twin primes; sequence gives a(n) = p(n)*(p(n)-1)/2.
%C A082669 This sequence also gives C(m, m-2) for all m such that m is the greater member of the n-th twin prime pair. - Christopher Tomaszewski (cmt1288(AT)comcast.net), Oct 26 2003
%C A082669 Let p(n) = upper member of n-th pair of twin primes; sequence gives a(n) = p(n)*(p(n)-1)/2. - _Zerinvary Lajos_, Mar 08 2007
%p A082669 ZL:=[]:for p from 1 to 890 do if (isprime(p) and isprime(p+2) ) then ZL:=[op(ZL),(binomial((p+2),p))]; fi; od; print(ZL); # _Zerinvary Lajos_, Mar 08 2007
%o A082669 (PARI) tpcomb2(n) = { forprime(x=3,n, if(isprime(x-2), print1((x)*(x-1)/2" ") ) ) }
%K A082669 easy,nonn
%O A082669 0,1
%A A082669 _Cino Hilliard_, May 18 2003