login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A292291
Number of vertices of type B at level n of the hyperbolic Pascal pyramid.
1
0, 0, 0, 3, 12, 36, 99, 264, 696, 1827, 4788, 12540, 32835, 85968, 225072, 589251, 1542684, 4038804, 10573731, 27682392, 72473448, 189737955, 496740420, 1300483308, 3404709507, 8913645216, 23336226144, 61095033219, 159948873516, 418751587332, 1096305888483
OFFSET
0,4
LINKS
László Németh, Hyperbolic Pascal pyramid, arXiv:1511.0267 [math.CO], 2015 (2nd line of Table 1).
FORMULA
a(n) = 4*a(n-1) - 4*a(n-2) + a(n-3), n >= 4.
G.f.: 3*x^3 / ((1 - x)*(1 - 3*x + x^2)). - Colin Barker, Sep 17 2017
a(n) = 3*Fibonacci(2*n - 3) - 3 for n > 0. - Ehren Metcalfe, Apr 18 2019
MATHEMATICA
CoefficientList[Series[3*x^3/((1 - x)*(1 - 3*x + x^2)), {x, 0, 30}], x] (* Wesley Ivan Hurt, Sep 17 2017 *)
LinearRecurrence[{4, -4, 1}, {0, 0, 0, 3}, 40] (* Harvey P. Dale, Oct 25 2017 *)
PROG
(PARI) concat(vector(3), Vec(3*x^3 / ((1 - x)*(1 - 3*x + x^2)) + O(x^40))) \\ Colin Barker, Sep 17 2017
CROSSREFS
Cf. A264236.
Sequence in context: A334891 A242526 A167667 * A215919 A027327 A290927
KEYWORD
nonn,easy
AUTHOR
Eric M. Schmidt, Sep 13 2017
STATUS
approved