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.

A291856 a(0) = -1, a(1) = 1, a(n) = a(n-1) + (n-1)*a(n-2) for n > 1.

This page as a plain text file.
%I A291856 #17 Sep 09 2017 21:43:22
%S A291856 -1,1,0,2,2,10,20,80,220,860,2840,11440,42680,179960,734800,3254240,
%T A291856 14276240,66344080,309040160,1503233600,7374996640,37439668640,
%U A291856 192314598080,1015987308160,5439223064000,29822918459840,165803495059840,941199375015680
%N A291856 a(0) = -1, a(1) = 1, a(n) = a(n-1) + (n-1)*a(n-2) for n > 1.
%H A291856 Seiichi Manyama, <a href="/A291856/b291856.txt">Table of n, a(n) for n = 0..800</a>
%F A291856 a(n+4) = 2*A249059(n) for n >= 0.
%F A291856 E.g.f.: exp(x*(2+x)/2) * (exp(1/2) * sqrt(2*Pi) * (erf((1+x)/sqrt(2)) - erf(1/sqrt(2))) - 1). - _Vaclav Kotesovec_, Sep 05 2017
%F A291856 a(n) ~ (sqrt(Pi) * exp(1/2) * (1 - erf(1/sqrt(2))) - sqrt(2)/2) * n^(n/2) * exp(sqrt(n) - n/2 - 1/4). - _Vaclav Kotesovec_, Sep 05 2017
%t A291856 RecurrenceTable[{a[0] == -1, a[1] == 1, a[n] == a[n-1] + (n-1)*a[n-2]}, a[n], {n, 0, 20}] (* _Vaclav Kotesovec_, Sep 04 2017 *)
%t A291856 CoefficientList[Series[E^(x*(2 + x)/2) * (E^(1/2)*Sqrt[2*Pi]*(Erf[(1 + x)/Sqrt[2]] - Erf[1/Sqrt[2]]) - 1), {x, 0, 20}], x]*Range[0, 20]! (* _Vaclav Kotesovec_, Sep 05 2017 *)
%o A291856 (GAP)
%o A291856 a:=[-1,1];; for n in [3..10^2] do a[n]:=a[n-1]+(n-2)*a[n-2]; od; a;  # _Muniru A Asiru_, Sep 07 2017
%Y A291856 Cf. A000085, A000932, A249059.
%K A291856 sign
%O A291856 0,4
%A A291856 _Seiichi Manyama_, Sep 04 2017