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!)
A104982 Column 3 of triangle A104980, omitting leading zeros. 4
1, 4, 21, 133, 977, 8135, 75609, 775667, 8707057, 106185715, 1398451353, 19786121467, 299384925569, 4825081148819, 82531968286569, 1493412479919371, 28504390805515921, 572363196501249667, 12061937537478658809 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Equals one-half of column 0 (after initial term) in triangle A104988, which equals the matrix square of triangle A104980.
LINKS
FORMULA
a(n) = A104988(n+1, 0)/2 for n>=0.
MATHEMATICA
T[n_, k_]:= T[n, k]= If[k<0 || k>n, 0, If[k==n, 1, If[k==n-1, n, k*T[n, k+1] + Sum[T[j, 0]*T[n, j+k+1], {j, 0, n-k-1}]]]];
Table[T[n+3, 3], {n, 0, 30}] (* G. C. Greubel, Jun 07 2021 *)
PROG
(PARI) {a(n) = if(n<0, 0, (matrix(n+4, n+4, m, j, if(m==j, 1, if(m==j+1, -m+1, -polcoeff((1-1/sum(i=0, m, i!*x^i))/x +O(x^m), m-j-1))))^-1)[n+4, 4])}
(Sage)
@CachedFunction
def T(n, k):
if (k<0 or k>n): return 0
elif (k==n): return 1
elif (k==n-1): return n
else: return k*T(n, k+1) + sum( T(j, 0)*T(n, j+k+1) for j in (0..n-k-1) )
[T(n+3, 3) for n in (0..30)] # G. C. Greubel, Jun 07 2021
CROSSREFS
Sequence in context: A303563 A284816 A226067 * A306335 A195440 A001909
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Apr 10 2005
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 July 15 08:33 EDT 2024. Contains 374324 sequences. (Running on oeis4.)