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.

A093328 a(n) = 2*n^2 + 3.

Original entry on oeis.org

3, 5, 11, 21, 35, 53, 75, 101, 131, 165, 203, 245, 291, 341, 395, 453, 515, 581, 651, 725, 803, 885, 971, 1061, 1155, 1253, 1355, 1461, 1571, 1685, 1803, 1925, 2051, 2181, 2315, 2453, 2595, 2741, 2891, 3045, 3203, 3365, 3531, 3701, 3875, 4053, 4235, 4421, 4611
Offset: 0

Views

Author

Ralf Stephan, Apr 25 2004

Keywords

Comments

Number of 132-avoiding two-stack sortable permutations which also avoid 4321.
Conjecture: no perfect powers. - Zak Seidov, Sep 27 2015
Numbers k such that 2*k - 6 is a square. - Bruno Berselli, Nov 08 2017

Crossrefs

Programs

Formula

a(n) = A005893(n)+1 = A058331(n)+2 = A001105(n)+3.
a(n+2) = A154685(n+1,n+2).
From Vincenzo Librandi, Jul 08 2012: (Start)
G.f.: (3 - 4*x + 5*x^2)/(1 - x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). (End)
Sum_{n>=0} 1/a(n) = (1 + sqrt(3/2)*Pi*coth(sqrt(3/2)*Pi))/6. - Amiram Eldar, Nov 25 2020
E.g.f.: exp(x)*(3 + 2*x + 2*x^2). - Elmo R. Oliveira, Jan 17 2025

Extensions

Simpler definition and new offset from Paul F. Brewbaker, Jun 23 2009
Edited by N. J. A. Sloane, Jun 27 2009