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 A271512 #26 Sep 08 2022 08:46:16 %S A271512 10,20,56,120,364,560,1140,1540,2600,4960,5984,9880,13244,15180,19600, %T A271512 27720,37820,41664,54740,64824,70300,88560,102340,125580,161700, %U A271512 182104,192920,215820,227920,253460,357760,392084,447580,467180,573800,596904,669920,748660 %N A271512 a(n) = (p+1)*(p+2)*(p+3)/6 where p is the n-th prime. %C A271512 Subsequence of A000292. %H A271512 Vincenzo Librandi, <a href="/A271512/b271512.txt">Table of n, a(n) for n = 1..1000</a> %F A271512 a(n) = A000292(A000040(n)+1). - _Michel Marcus_, Apr 10 2016 %p A271512 A271512:=n->(ithprime(n)+1)*(ithprime(n)+2)*(ithprime(n)+3)/6: seq(A271512(n), n=1..80); # _Wesley Ivan Hurt_, Apr 10 2016 %t A271512 Table[(Prime[n]^3 + 6 Prime[n]^2 + 11 Prime[n] + 6) / 6, {n, 50}] %o A271512 (Magma) [(p+1)*(p+2)*(p+3) / 6: p in PrimesUpTo(200)]; %o A271512 (Python) %o A271512 from sympy import prime %o A271512 for n in range(1,1000): %o A271512 p=prime(n) %o A271512 print((int)(((p+1)*(p+2)*(p+3))/6)) %o A271512 # _Soumil Mandal_, Apr 11 2016 %o A271512 (PARI) lista(nn) = forprime(p=2, nn, print1((p+1)*(p+2)*(p+3)/6, ", ")); \\ _Altug Alkan_, Apr 10 2016 %Y A271512 Cf. A000040, A000292, A271511. %K A271512 nonn,easy %O A271512 1,1 %A A271512 _Vincenzo Librandi_, Apr 10 2016