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.

A084175 Jacobsthal oblong numbers.

Original entry on oeis.org

0, 1, 3, 15, 55, 231, 903, 3655, 14535, 58311, 232903, 932295, 3727815, 14913991, 59650503, 238612935, 954429895, 3817763271, 15270965703, 61084037575, 244335800775, 977343902151, 3909374210503, 15637499638215, 62549992960455
Offset: 0

Views

Author

Paul Barry, May 18 2003

Keywords

Comments

Inverse binomial transform is A001019 doubled up.
Binomial transform is A084177.
Partial sums of A003683.

Crossrefs

Except for initial terms, same as A015249 and A084152.

Programs

Formula

a(n) = A001045(n)*A001045(n+1).
a(n) = (2*4^n - (-2)^n - 1)/9;
a(n) = 3*a(n-1) + 6*a(n-2) - 8*a(n-3), a(0)=0, a(1)=1, a(2)=3.
G.f.: x/((1+2*x)*(1-x)*(1-4*x)).
E.g.f.: (2*exp(4*x) - exp(x) - exp(-2*x))/9.
a(n+1) - 4*a(n) = 1, -1, 3, -5, 11, ... = A001045(n+1) signed. - Paul Curtz, May 19 2008
a(n) = round(2^n/3) * round(2^(n+1)/3). - Gary Detlefs, Feb 10 2010
From Peter Bala, Mar 30 2015: (Start)
The shifted o.g.f. A(x) := 1/( (1 + 2*x)*(1 - x)*(1 - 4*x) ) = 1/(1 - 3*x - 6*x^2 + 8*x^3). Hence A(x) == 1/(1 - 3*x + 3*x^2 - x^3) (mod 9) == 1/(1 - x)^3 (mod 9). It follows by Theorem 1 of Heninger et al. that (A(x))^(1/3) = 1 + x + 4*x^2 + 10*x^3 + ... has integral coefficients.
Sum_{n >= 0} a(n+1)*x^n = exp( Sum_{n >= 1} J(3*n)/J(n)*x^n/n ), where J(n) = A001045(n) are the Jacobsthal numbers. Cf. A001656, A099930. (End)