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.

A152599 a(n) = 10*a(n-1) - 12*a(n-2) for n > 1; a(0) = 1, a(1) = 4 .

Original entry on oeis.org

1, 4, 28, 232, 1984, 17056, 146752, 1262848, 10867456, 93520384, 804794368, 6925699072, 59599458304, 512886194176, 4413668442112, 37982050091008, 326856479604736, 2812780194955264, 24205524194295808, 208301879603494912, 1792552505703399424, 15425902501792055296
Offset: 0

Views

Author

Philippe Deléham, Dec 09 2008

Keywords

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{10, -12}, {1, 4}, 25] (* Paolo Xausa, Jan 19 2024 *)

Formula

G.f.: (1-6*x)/(1-10*x+12*x^2).
a(n) = Sum_{k=0..n} A147703(n,k)*3^(n-k).
a(n) = 2^n*A052961(n). - R. J. Mathar, Jun 14 2016