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.

A005056 a(n) = 3^n + 2^n - 1.

Original entry on oeis.org

1, 4, 12, 34, 96, 274, 792, 2314, 6816, 20194, 60072, 179194, 535536, 1602514, 4799352, 14381674, 43112256, 129271234, 387682632, 1162785754, 3487832976, 10462450354, 31385253912, 94151567434, 282446313696, 847322163874, 2541932937192, 7625731702714
Offset: 0

Views

Author

Keywords

Comments

Binomial transform of A083313. - Paul Barry, Apr 25 2003
Let P(A) be the power set of an n-element set A and R be a relation on P(A) such that for all x, y of P(A), xRy if either 0) x is a proper subset of y or y is a proper subset of x and x and y are disjoint, 1) x is not a subset of y and y is not a subset of x and x and y are disjoint, or 2) x equals y. Then a(n) = |R|. - Ross La Haye, Mar 19 2009

Crossrefs

Cf. A083313.

Programs

Formula

From Paul Barry, Apr 25 2003: (Start)
G.f.: (1-2x-x^2)/((1-x)(1-2x)(1-3x)).
E.g.f.: exp(3x) + exp(2x) - exp(x). (End)
a(n) = 5*a(n-1) - 6*a(n-2) - 2 for n > 1, a(0)=1, a(1)=4. - Vincenzo Librandi, Dec 31 2010
a(n) = 6*a(n-1) - 11*a(n-2) + 6*a(n-3) for n > 2, a(0)=1, a(1)=4, a(2)=12. - Rick L. Shepherd, Aug 07 2017
a(n) = A007689(n)-1. - R. J. Mathar, Mar 10 2022