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-1 of 1 results.

A291287 a(0)=a(1)=1, a(2)=3, thereafter a(n) = n*a(n-1)+(n-1)*(n-2)*a(n-2).

Original entry on oeis.org

1, 1, 3, 11, 62, 442, 3892, 40504, 487496, 6655688, 101656592, 1717234432, 31789038304, 639932442976, 13918144177088, 325239867277952, 8126648153635712, 216210586758515584, 6102238859442194176, 182102977877507458048, 5729025247479379569152
Offset: 0

Views

Author

N. J. A. Sloane, Aug 27 2017

Keywords

Crossrefs

Programs

  • Maple
    f:=proc(n) option remember;
    if n <= 1 then 1 elif n=2 then 3 else
    n*f(n-1)+(n-1)*(n-2)*f(n-2); fi; end;
    [seq(f(n),n=0..20)];
  • Mathematica
    nxt[{n_,a_,b_}]:={n+1,b,b(n+1)+n(n-1)a}; Join[{1},NestList[nxt,{2,1,3},20][[;;,2]]] (* Harvey P. Dale, Jan 20 2024 *)
Showing 1-1 of 1 results.