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.

A002020 a(n+1) = a(n) - n*(n-1)*a(n-1), with a(n) = 1 for n <= 3.

Original entry on oeis.org

1, 1, 1, 1, -5, -17, 83, 593, -2893, -36101, 172195, 3421285, -15520165, -467129785, 1954015955, 86971636825, -323371713725, -21196564551725, 66760541581475, 6552909294409325, -16279195926455125, -2506384727801998625, 4330877561309153875
Offset: 0

Views

Author

Keywords

References

  • R. Kelisky, The numbers generated by exp(arctan x), Duke Math. J., 26 (1959), 569-581.
  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Programs

  • Maple
    f := proc(n) option remember; if n<=3 then 1 else f(n-1)-(n-1)*(n-2)*f(n-2); fi; end;
  • Mathematica
    t = {1, 1, 1, 1}; Do[AppendTo[t, t[[-1]] - (n-1) (n - 2) t[[-2]]], {n, 4, 20}] (* T. D. Noe, Aug 30 2012 *)