The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099953 a(n) = A076795(n) - 1. 1
 0, 1, 4, 19, 124, 1069, 11464, 146599, 2173624, 36633049, 691362124, 14440672699, 330674815924, 8236528396549, 221694575073424, 6411977928702799, 198310761891213424, 6530970632654064049, 228174066109353835924 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS FORMULA a(n) = (2*n-2)*a(n-1)-(2*n-3)*a(n-2) with a(1)=0, a(2)=1. - Emeric Deutsch and Ira M. Gessel, Dec 19 2004 G.f.: A(x)=x/(1-x)/(U(0)-x), where U(k)= (2*k+1)*x + 1 - (2*k+3)*x/U(k+1); (continued fraction Euler's 1st kind, 1-step ). - Sergei N. Gladkovskii, Jun 27 2012 MAPLE a[1]:=0: a[2]:=1: for n from 3 to 30 do a[n]:=(2*n-2)*a[n-1]-(2*n-3)*a[n-2] od:seq(a[j], j=1..18); # Emeric Deutsch, Dec 20 2004 MATHEMATICA s = 0; lst = {s}; Do[s += n!!; AppendTo[lst, s], {n, 1, 32, 2}]; lst (* Zerinvary Lajos, Jul 13 2009 *) CROSSREFS Cf. A001147. Sequence in context: A094822 A280939 A121125 * A009324 A203236 A103468 Adjacent sequences:  A099950 A099951 A099952 * A099954 A099955 A099956 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, Nov 12 2004 EXTENSIONS More terms from Emeric Deutsch and Ira M. Gessel, Dec 20 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 9 18:30 EDT 2021. Contains 343744 sequences. (Running on oeis4.)