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.

A007613 a(n) = (8^n + 2*(-1)^n)/3.

Original entry on oeis.org

1, 2, 22, 170, 1366, 10922, 87382, 699050, 5592406, 44739242, 357913942, 2863311530, 22906492246, 183251937962, 1466015503702, 11728124029610, 93824992236886, 750599937895082, 6004799503160662, 48038396025285290, 384307168202282326, 3074457345618258602
Offset: 0

Views

Author

Keywords

Comments

Also, the cogrowth sequence of C3 X C3 = ; that is, the number of words of length 3n that reduce to the identity. - Sean A. Irvine, Nov 04 2024

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

Formula

a(n) = A078008(3*n). - Paul Barry, Nov 29 2003
From Paul Barry, Mar 24 2004: (Start)
a(n) = (A082311(n) + (-1)^n)/2.
a(n) = (A001045(3*n+1) + (-1)^n)/2. (End)
a(n) = Sum_{k=0..n} binomial(3*n, 3*k). - Paul Barry, Jan 13 2005
a(n) = 8*a(n-1) + 6*(-1)^n. - Paul Curtz, Nov 19 2007
From Colin Barker, Sep 29 2014: (Start)
a(n) = 7*a(n-1) + 8*a(n-2).
G.f.: (1-5*x) / ((1+x)*(1-8*x)). (End)
E.g.f.: (1/3)*(exp(8*x) + 2*exp(-x)). - G. C. Greubel, Apr 23 2023

Extensions

More terms from Colin Barker, Sep 29 2014