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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055827 a(n) = T(2n+3,n), array T as in A055818. 8
1, 23, 144, 848, 4880, 27816, 157920, 895264, 5074272, 28772280, 163262704, 927203184, 5270629104, 29988361032, 170780080320, 973422085184, 5552990609344, 31702646247768, 181128948471888, 1035584204252560 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
MAPLE
T:= proc(i, j) option remember;
if i=0 or j=0 then 1
else add(add(T(h, m), m=0..j), h=0..i-1)
fi; end:
seq(T(n+3, n), n=0..30); # G. C. Greubel, Jan 22 2020
MATHEMATICA
T[i_, j_]:= T[i, j]= If[i==0 || j==0, 1, Sum[T[h, m], {h, 0, i-1}, {m, 0, j}]]; Table[T[n+3, n], {n, 0, 25}] (* G. C. Greubel, Jan 22 2020 *)
PROG
(Sage)
@CachedFunction
def T(i, j):
if (i==0 or j==0): return 1
else: return sum(sum(T(h, m) for m in (0..j)) for h in (0..i-1))
[T(n+3, n) for n in (0..30)] # G. C. Greubel, Jan 22 2020
CROSSREFS
Sequence in context: A220796 A220960 A139175 * A255418 A268778 A231207
KEYWORD
nonn
AUTHOR
Clark Kimberling, May 28 2000
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)