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.

A057721 a(n) = n^4 + 3*n^2 + 1.

Original entry on oeis.org

1, 5, 29, 109, 305, 701, 1405, 2549, 4289, 6805, 10301, 15005, 21169, 29069, 39005, 51301, 66305, 84389, 105949, 131405, 161201, 195805, 235709, 281429, 333505, 392501, 459005, 533629, 617009, 709805, 812701, 926405, 1051649
Offset: 0

Views

Author

N. J. A. Sloane, Oct 27 2000

Keywords

Comments

Longest possible side c of a triangle with integer sides a <= b < c and inradius n. Triangle has sides (n^2+2, n^4+2n^2+1, n^4+3n^2+1). Proved by Joseph Myers, Jun 11 2006.

Crossrefs

See A120062 for sequences related to integer-sided triangles with integer inradius n.
Cf. A120062 [triangles with integer inradius], A120063 [minimum of their longest sides].

Programs

Formula

a(n) = denominator of Integral_{x=0..infinity} sin(n*x)/exp((n^2+1)*x). - Francesco Daddi, Jul 07 2013