OFFSET
1,1
LINKS
Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).
FORMULA
a(n) > n^2.
From Colin Barker, May 05 2017: (Start)
G.f.: x*(3 - x + x^2 + x^3) / ((1 - x)^3*(1 + x)).
a(n) = 3/2 - (-1)^n/2 + n^2.
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4) for n>4. (End)
Sum_{n>=1} 1/a(n) = Pi*coth(Pi/2)/4 + Pi*tanh(Pi/sqrt(2))/(4*sqrt(2)) - 1/2. - Amiram Eldar, Jul 26 2024
EXAMPLE
MAPLE
MATHEMATICA
Table[2 (Ceiling[n^2/2] + 1) - 1, {n, 1, 40}]
PROG
(PARI) Vec(x*(3 - x + x^2 + x^3) / ((1 - x)^3*(1 + x)) + O(x^60)) \\ Colin Barker, May 05 2017
(Magma) [3/2 - (-1)^n/2 + n^2 : n in [1..100]]; // Wesley Ivan Hurt, May 05 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ralf Steiner, May 05 2017
EXTENSIONS
More terms from Colin Barker, May 05 2017
STATUS
approved