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.

Showing 1-2 of 2 results.

A352280 a(0) = 1; a(n) = 3 * Sum_{k=0..floor((n-1)/2)} binomial(n-1,2*k) * a(n-2*k-1).

Original entry on oeis.org

1, 3, 9, 30, 117, 516, 2493, 13152, 75177, 460272, 3003921, 20806176, 152114013, 1169842368, 9435180357, 79553524224, 699531782481, 6400932102912, 60820145019801, 599036357936640, 6105903392066373, 64309189153428480, 698936466350352717, 7828833281592926208, 90270159223293364473
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 10 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = 3 Sum[Binomial[n - 1, 2 k] a[n - 2 k - 1], {k, 0, Floor[(n - 1)/2]}]; Table[a[n], {n, 0, 24}]
    nmax = 24; CoefficientList[Series[Exp[3 Sinh[x]], {x, 0, nmax}], x] Range[0, nmax]!
  • PARI
    my(N=40, x='x+O('x^N)); Vec(serlaplace(exp(3*sinh(x)))) \\ Seiichi Manyama, Mar 26 2022

Formula

E.g.f.: exp( 3 * sinh(x) ).
a(n) = Sum_{k=0..n} 3^k * A136630(n,k). - Seiichi Manyama, Feb 18 2025

A352278 a(0) = 1; a(n) = -3 * Sum_{k=1..n} binomial(2*n-1,2*k-1) * a(n-k).

Original entry on oeis.org

1, -3, 24, -273, 3399, -31728, -280371, 26388177, -580539936, -17406321933, 1809690920979, -18045563411208, -6249108953966151, 333062472085204677, 27673022056089337224, -3800202930423874873353, -139584280492439116159521, 52779027474493111545620352, 279012844299708383976573189
Offset: 0

Views

Author

Ilya Gutkovskiy, Mar 10 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[0] = 1; a[n_] := a[n] = -3 Sum[Binomial[2 n - 1, 2 k - 1] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 18}]
    nmax = 36; Take[CoefficientList[Series[Exp[3 (1 - Cosh[x])], {x, 0, nmax}], x] Range[0, nmax]!, {1, -1, 2}]

Formula

E.g.f.: exp( 3 * (1 - cosh(x)) ) (even powers only).
Showing 1-2 of 2 results.