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 A034953 #54 Feb 16 2025 08:32:37
%S A034953 3,6,15,28,66,91,153,190,276,435,496,703,861,946,1128,1431,1770,1891,
%T A034953 2278,2556,2701,3160,3486,4005,4753,5151,5356,5778,5995,6441,8128,
%U A034953 8646,9453,9730,11175,11476,12403,13366,14028,15051,16110,16471,18336,18721,19503
%N A034953 Triangular numbers (A000217) with prime indices.
%C A034953 The following sequences (allowing offset of first term) all appear to have the same parity: A034953, triangular numbers with prime indices; A054269, length of period of continued fraction for sqrt(p), p prime; A082749, difference between the sum of next prime(n) natural numbers and the sum of next n primes; A006254, numbers n such that 2n-1 is prime; A067076, 2n+3 is a prime. - _Jeremy Gardiner_, Sep 10 2004
%C A034953 Given a rectangular prism with sides 1, p, p^2 for p = n-th prime (n > 1), the area of the six sides divided by the volume gives a remainder which is 4*a(n). - _J. M. Bergot_, Sep 12 2011
%C A034953 The infinite sum over the reciprocals is given by 2*A179119. - _Wolfdieter Lang_, Jul 10 2019
%H A034953 Charles R Greathouse IV, <a href="/A034953/b034953.txt">Table of n, a(n) for n = 1..10000</a>
%H A034953 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TriangularNumber.html">Triangular Number</a>.
%F A034953 a(n) = A000217(A000040(n)). - _Omar E. Pol_, Jul 27 2009
%F A034953 a(n) = Sum_{k=1..prime(n)} k. - _Wesley Ivan Hurt_, Apr 27 2021
%F A034953 Product_{n>=1} (1 - 1/a(n)) = A307868. - _Amiram Eldar_, Nov 07 2022
%p A034953 a:= n-> (p-> p*(p+1)/2)(ithprime(n)):
%p A034953 seq(a(n), n=1..65); # _Alois P. Heinz_, Apr 20 2022
%t A034953 t[n_] := n(n + 1)/2; Table[t[Prime[n]], {n, 44}] (* _Robert G. Wilson v_, Aug 12 2004 *)
%t A034953 (#(# + 1))/2&/@Prime[Range[50]] (* _Harvey P. Dale_, Feb 27 2012 *)
%t A034953 With[{nn=200},Pick[Accumulate[Range[nn]],Table[If[PrimeQ[n],1,0],{n,nn}],1]] (* _Harvey P. Dale_, Mar 05 2023 *)
%o A034953 (PARI) forprime(p=2,1e3,print1(binomial(p+1,2)", ")) \\ _Charles R Greathouse IV_, Jul 19 2011
%o A034953 (PARI) apply(n->binomial(n+1,2),primes(100)) \\ _Charles R Greathouse IV_, Jun 04 2013
%o A034953 (Haskell)
%o A034953 a034953 n = a034953_list !! (n-1)
%o A034953 a034953_list = map a000217 a000040_list
%o A034953 -- _Reinhard Zumkeller_, Sep 23 2011
%Y A034953 Cf. A000217, A034954, A034955, A011756, A179119, A195678, A307868.
%Y A034953 Cf. A054269, A067076, A082749.
%K A034953 nonn,easy
%O A034953 1,1
%A A034953 _Patrick De Geest_, Oct 15 1998