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.

A341905 a(n) = a(n-1) + a(n-2) + 2*a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2.

Original entry on oeis.org

3, 0, 2, 8, 10, 22, 48, 90, 182, 368, 730, 1462, 2928, 5850, 11702, 23408, 46810, 93622, 187248, 374490, 748982, 1497968, 2995930, 5991862, 11983728, 23967450, 47934902, 95869808, 191739610, 383479222, 766958448, 1533916890, 3067833782, 6135667568, 12271335130
Offset: 0

Views

Author

Michael De Vlieger, Jun 04 2021

Keywords

Crossrefs

Programs

  • Maple
    a:= n-> (<<0|1|0>, <0|0|1>, <2|1|1>>^n. <<3, 0, 2>>)[1,1]:
    seq(a(n), n=0..34);  # Alois P. Heinz, Jun 04 2021
  • Mathematica
    LinearRecurrence[{1, 1, 2}, {3, 0, 2}, 35] (* or *)
    CoefficientList[Series[(-3 + 3 x + x^2)/(-1 + x + x^2 + 2 x^3), {x, 0, 34}], x]

Formula

G.f.: (-3 + 3*x + x^2)/(-1 + x + x^2 + 2*x^3).
a(n) = (10*2^(n-1) + 13*A049347(n) - 9*A079978(n+1) + 3)/7. - Greg Dresden, Jun 20 2021