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!)
 A062747 Row sums of (unsigned) staircase array A062746. 2
 1, 7, 89, 1447, 26713, 532391, 11165785, 242851751, 5427716185, 123901026215, 2876525797465, 67710590623655, 1612262780199001, 38764533106581415, 939825790848884825, 22950405085586497447 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA a(n)=N(3; k, x=-1), with the polynomials N(3; k, x) from the staircase array A062746. a(n) = 2*( Sum_{j = 0..n} (-1)^j*C(3; n-j)*4^(n-j) ) - (-1)^n with C(3; n) := A001764(n) = A062993(n+1, 1) (a Pfaff-Fuss or 3-Raney sequence). G.f.: (2*c(3; 4*x)-1)/(1+x) with c(3; x)= RootOf(x*_Z^3-_Z +1), the g.f. of A001764 [formula for a(n) and g.f. corrected by Peter Bala, Mar 26 2020]. Conjectural recurrence: n*(2*n+1)*a(n) = (4*n-3)*(13*n-4)*a(n-1) + 6*(3*n-1)*(3*n-2)*a(n-2) with a(0) = 1, a(1) = 7. - Peter Bala, Mar 25 2020 CROSSREFS Sequence in context: A069661 A069662 A295543 * A099719 A142995 A200832 Adjacent sequences:  A062744 A062745 A062746 * A062748 A062749 A062750 KEYWORD nonn,easy AUTHOR Wolfdieter Lang, Jul 12 2001 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 26 17:16 EDT 2020. Contains 334630 sequences. (Running on oeis4.)