The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A026553 a(n) = T(n,n), T given by A026552. Also a(n) is the number of integer strings s(0),...,s(n) counted by T, such that s(n)=0. 18
 1, 1, 3, 4, 12, 20, 58, 104, 300, 556, 1608, 3032, 8806, 16778, 48924, 93872, 274644, 529684, 1553940, 3008864, 8846772, 17184188, 50618184, 98577712, 290817566, 567591142, 1676640462, 3278348608, 9694857750, 18986482250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 FORMULA a(n) = A026552(n,n). MATHEMATICA T[n_, k_]:= T[n, k]= If[k==0 || k==2*n, 1, If[k==1 || k==2*n-1, Floor[(n+2)/2], If[EvenQ[n], T[n-1, k-2] + T[n-1, k] + T[n-1, k-1], T[n-1, k-2] + T[n-1, k]]]]; (* T=A026552 *) Table[T[n, n], {n, 0, 40}] (* G. C. Greubel, Dec 17 2021 *) PROG (Sage) @CachedFunction def T(n, k): # T = A026552     if (k==0 or k==2*n): return 1     elif (k==1 or k==2*n-1): return (n+2)//2     elif (n%2==0): return T(n-1, k) + T(n-1, k-1) + T(n-1, k-2)     else: return T(n-1, k) + T(n-1, k-2) [T(n, n) for n in (0..40)] # G. C. Greubel, Dec 17 2021 CROSSREFS Cf. A026552, A026554, A026555, A026556, A026557, A026558, A026559, A026560, A026563, A026563, A026566, A026567, A027272, A027273, A027274, A027275, A027276. Sequence in context: A124639 A279696 A279248 * A282220 A281892 A101727 Adjacent sequences:  A026550 A026551 A026552 * A026554 A026555 A026556 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 January 26 23:54 EST 2022. Contains 350601 sequences. (Running on oeis4.)