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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026861 T(2n,n+1), T given by A026747. 0
 1, 5, 22, 95, 411, 1790, 7855, 34725, 154573, 692450, 3120206, 14135555, 64356345, 294341325, 1351889910, 6233399525, 28845511125, 133933280000, 623811120960, 2913924782375, 13648296620445, 64087737455725, 301644762913977 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n+1)=p(n+1) where p(x) is the unique degree-n polynomial such that p(k)=A002212(k+1) for k=0,1,...,n. - Michael Somos, Oct 07 2003 Number of skew Dyck paths of semilength n+1 containing at least one left step. - David Scambler, Jun 17 2013 LINKS FORMULA a(n) = A002212(n+1) - A000108(n+1). - David Scambler, Jun 17 2013 PROG (PARI) a(n)=if(n<1, 0, subst(polinterpolate(Vec((1-3*x-sqrt(1-6*x+5*x^2+x^2*O(x^n)))/2)), x, n+1)) CROSSREFS Sequence in context: A141222 A127360 A116415 * A026888 A266430 A083586 Adjacent sequences:  A026858 A026859 A026860 * A026862 A026863 A026864 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 December 4 15:16 EST 2020. Contains 338927 sequences. (Running on oeis4.)