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.

A098996 a(n) = p*(p + 1)*(2*p + 1) where p is the n-th prime.

This page as a plain text file.
%I A098996 #41 Mar 24 2025 02:01:26
%S A098996 30,84,330,840,3036,4914,10710,14820,25944,51330,62496,105450,142926,
%T A098996 164604,214320,306234,421260,465186,615060,731016,794094,1004880,
%U A098996 1164324,1433790,1853670,2091306,2217384,2484540,2625810,2924214,4145280,4547796,5199150,5429340
%N A098996 a(n) = p*(p + 1)*(2*p + 1) where p is the n-th prime.
%C A098996 The unique primitive Pythagorean triple whose inradius is the n-th prime p and whose short leg is an odd number is (2*p+1, 2*p*(p+1), 2*p*(p+1)+1) and its area is a(n) = p*(p+1)*(2*p+1). - _Miguel-Ángel Pérez García-Ortega_, Mar 16 2025
%D A098996 Miguel Ángel Pérez García-Ortega, José Manuel Sánchez Muñoz and José Miguel Blanco Casado, El Libro de las Ternas Pitagóricas, Preprint 2025.
%H A098996 Harvey P. Dale, <a href="/A098996/b098996.txt">Table of n, a(n) for n = 1..1000</a>
%F A098996 a(n) = prime(n)*(prime(n)+1)*(2*prime(n)+1).
%e A098996 a(4) = 7*(7+1)*(2*7+1) = 840.
%t A098996 #(#+1)(2#+1)&/@Prime[Range[30]] (* _Harvey P. Dale_, Jun 23 2020 *)
%o A098996 (Magma) [(p*(p+1)*(2*p+1)): p in PrimesUpTo(200)]; // _Vincenzo Librandi_, Feb 04 2011
%Y A098996 Cf. A034953, A367573, A382097, A382070.
%K A098996 nonn
%O A098996 1,1
%A A098996 _Parthasarathy Nambi_, Nov 05 2004
%E A098996 More terms from _Klaus Brockhaus_, Nov 09 2004