cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A055829 a(n) = T(2n+5,n), array T as in A055818.

This page as a plain text file.
%I A055829 #7 Jan 23 2020 12:25:19
%S A055829 1,95,768,5216,33024,201792,1208320,7145792,41919744,244590496,
%T A055829 1421823232,8243669664,47708339712,275738420864,1592186658816,
%U A055829 9187634766976,52992487665152,305556178607328,1761501729738496
%N A055829 a(n) = T(2n+5,n), array T as in A055818.
%H A055829 G. C. Greubel, <a href="/A055829/b055829.txt">Table of n, a(n) for n = 0..250</a>
%p A055829 T:= proc(i, j) option remember;
%p A055829       if i=0 or j=0 then 1
%p A055829     else add(add(T(h,m), m=0..j), h=0..i-1)
%p A055829   fi; end:
%p A055829 seq(T(n+5, n), n=0..30); # _G. C. Greubel_, Jan 23 2020
%t A055829 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+5, n], {n,0,30}] (* _G. C. Greubel_, Jan 23 2020 *)
%o A055829 (Sage)
%o A055829 @CachedFunction
%o A055829 def T(i, j):
%o A055829     if (i==0 or j==0): return 1
%o A055829     else: return sum(sum(T(h,m) for m in (0..j)) for h in (0..i-1))
%o A055829 [T(n+5, n) for n in (0..30)] # _G. C. Greubel_, Jan 23 2020
%Y A055829 Cf. A055818, A055819, A055820, A055821, A055822, A055823, A055824, A055825, A055826, A055827, A055828.
%K A055829 nonn
%O A055829 0,2
%A A055829 _Clark Kimberling_, May 28 2000