# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a002019 Showing 1-1 of 1 %I A002019 M4330 N1813 #67 Jun 01 2024 11:44:24 %S A002019 1,1,1,-1,-7,5,145,-5,-6095,-5815,433025,956375,-46676375,-172917875, %T A002019 7108596625,38579649875,-1454225641375,-10713341611375, %U A002019 384836032842625,3663118565923375,-127950804666254375,-1519935859717136875 %N A002019 a(n) = a(n-1) - (n-1)(n-2)a(n-2). %D A002019 Dwight, Tables of Integrals ..., Eq. 552.5, page 133. %D A002019 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A002019 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A002019 T. D. Noe, Table of n, a(n) for n = 0..100 %H A002019 G. Guillotte and L. Carlitz, Problem H-216 and solution, Fib. Quarter. p. 90, Vol 13, 1, Feb. 1975. %H A002019 R. Kelisky, The numbers generated by exp(arctan x), Duke Math. J., 26 (1959), 569-581. %H A002019 H. P. Robinson and N. J. A. Sloane, Correspondence, 1971-1972 %H A002019 Kruchinin Vladimir Victorovich, Composition of ordinary generating functions, arXiv:1009.2565 [math.CO], 2010. %F A002019 E.g.f.: exp(arctan(x)). %F A002019 a(n) = n!*sum(if oddp(m+n) then 0 else (-1)^((3*n+m)/2)/(2^m*m!)*sum(2^i*binomial(n-1,i-1)*m!/i!*stirling1(i,m),i,m,n),m,1,n), n>0. - _Vladimir Kruchinin_, Aug 05 2010 %F A002019 E.g.f.: exp(arctan(x)) = 1 + 2x/(H(0)-x); H(k) = 4k + 2 + x^2*(4k^2 + 8k + 5)/H(k+1); (continued fraction). - _Sergei N. Gladkovskii_, Nov 15 2011 %F A002019 a(n+1) = a(n) - a(n-1) * A002378(n-2). - _Reinhard Zumkeller_, Feb 27 2012 %F A002019 E.g.f.: -2i*(B((1+ix)/2; (2-i)/2, (2+i)/2) - B(1/2; (2-i)/2, (2+i)/2)), for a(0)=0, a(1)=a(2)=a(3)=1, B(x;a,b) is the incomplete Beta function. - _G. C. Greubel_, May 01 2015 %F A002019 a(n) = i^n*n!*Sum_{r+s=n} (-1)^s*binomial(-i/2, r)*binomial(i/2,s) where i is the imaginary unit. See the Fib. Quart. link. - _Michel Marcus_, Jan 22 2017 %t A002019 RecurrenceTable[{a[0]==1,a[1]==1,a[n]==a[n-1]-(n-1)(n-2)a[n-2]}, a[n],{n,30}] (* _Harvey P. Dale_, May 02 2011 *) %t A002019 CoefficientList[Series[E^(ArcTan[x]),{x,0,20}],x]*Range[0,20]! (* _Vaclav Kotesovec_, Nov 06 2014 *) %o A002019 (Maxima) a(n):=n!*sum(if oddp(m+n) then 0 else (-1)^((3*n+m)/2)/(2^m*m!)*sum(2^i*binomial(n-1,i-1)*m!/i!*stirling1(i,m),i,m,n),m,1,n); /* _Vladimir Kruchinin_, Aug 05 2010 */ %o A002019 (Haskell) %o A002019 a002019 n = a002019_list !! n %o A002019 a002019_list = 1 : 1 : zipWith (-) %o A002019 (tail a002019_list) (zipWith (*) a002019_list a002378_list) %o A002019 -- _Reinhard Zumkeller_, Feb 27 2012 %o A002019 (Magma) I:=[1,1]; [1] cat [ n le 2 select I[n] else Self(n-1)-(n^2-3*n+2)*Self(n-2): n in [1..35]]; // _Vincenzo Librandi_, May 02 2015 %Y A002019 Bisections are A102058 and A102059. %Y A002019 Cf. A006228. %Y A002019 Row sums of signed triangle A049218. %Y A002019 Cf. A000246. %K A002019 sign,nice,easy %O A002019 0,5 %A A002019 _N. J. A. Sloane_ %E A002019 More terms from _Herman P. Robinson_ # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE