This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A147308 Riordan array [sech(x), asin(tanh(x))]. 3
 1, 0, 1, -1, 0, 1, 0, -4, 0, 1, 5, 0, -10, 0, 1, 0, 40, 0, -20, 0, 1, -61, 0, 175, 0, -35, 0, 1, 0, -768, 0, 560, 0, -56, 0, 1, 1385, 0, -4996, 0, 1470, 0, -84, 0, 1, 0, 24320, 0, -22720, 0, 3360, 0, -120, 0, 1, -50521, 0, 214445, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 COMMENTS Production array is [cos(x),x] beheaded. Inverse is A147309. Row sums are A012123(n+1). If signs are ignored this is identical to A147309. - N. J. A. Sloane, Nov 07 2008 [gd(x)]^m=sum(n>=m T(n,m)*m!/n!*x^n), where gd(x) is  Gudermannian function, T(n,m)=sum(j=0..(n-m)/2, (sum(i=0..2*j, (2^(i)*stirling1(i+m,m)*binomial(2*j+m-1,i+m-1))/(i+m)!))*sum(k=0..n-2*j-m, (-1)^(k+j)*binomial(k+2*j+m-1,2*j+m-1)*(k+2*j+m)!*2^(-k-2*j)*stirling2(n,k+2*j+m))), n>=m>=1. [From Vladimir Kruchinin, Dec 18 2011] LINKS Nathaniel Johnston, Table of n, a(n) for n = 0..229 EXAMPLE Triangle begins 1, 0, 1, -1, 0, 1, 0, -4, 0, 1, 5, 0, -10, 0, 1, 0, 40, 0, -20, 0, 1, -61, 0, 175, 0, -35, 0, 1 MAPLE Z := proc(n, x) option remember; if n = 0 then return 1: else return 1/2*x*(Z(n-1, x-1)+Z(n-1, x+1)): fi:end: with(PolynomialTools): for n from 1 to 10 do for k from 1 to n do printf("%d, ", (-1)^floor((n-k)/2)*coeff(Z(n, x), x, k)):od: printf("\n"):od: # Nathaniel Johnston, Apr 21 2011 CROSSREFS Sequence in context: A065623 A178103 A147309 * A110064 A021253 A136586 Adjacent sequences:  A147305 A147306 A147307 * A147309 A147310 A147311 KEYWORD easy,sign,tabl AUTHOR Paul Barry, Nov 05 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .