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!)
 A026582 a(n) = Sum{T(i,j)}, 0<=j<=i, 0<=i<=n, T given by A026568. 0
 1, 3, 8, 20, 50, 125, 314, 792, 2003, 5079, 12897, 32798, 83478, 212657, 542040, 1382376, 3526916, 9001805, 22982298, 58691692, 149919707, 383028163, 978768731, 2501494110, 6394118165, 16346237219, 41793150985, 106865638630 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA Conjecture: n*a(n) +2*(-2*n+1)*a(n-1) +2*(-n+3)*a(n-2) +20*(n-2)*a(n-3) +(-7*n+6)*a(n-4) +2*(-12*n+41)*a(n-5) +8*(2*n-7)*a(n-6)=0. - R. J. Mathar, Jun 23 2013 CROSSREFS Sequence in context: A178167 A078053 A122595 * A187003 A101893 A140662 Adjacent sequences:  A026579 A026580 A026581 * A026583 A026584 A026585 KEYWORD nonn AUTHOR 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 June 19 03:06 EDT 2021. Contains 345125 sequences. (Running on oeis4.)