The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A298309 Triangle read by rows: T(n,m) = Sum_{i=0..n+1} C(n-i+1,i-1)*C(n-i+1,i)*C(n-i+1,m-i+1). 0
0, 1, 1, 2, 4, 2, 3, 11, 13, 5, 4, 25, 51, 43, 13, 5, 49, 149, 203, 130, 32, 6, 86, 364, 716, 734, 382, 80, 7, 139, 787, 2099, 3061, 2521, 1105, 201, 8, 211, 1553, 5385, 10455, 12093, 8311, 3143, 505, 9, 305, 2851, 12473, 30918, 47064, 45075, 26581, 8843, 1273 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
G.f.: ((1-(1-x*y)*(x*y+x))/sqrt((1-(x*y+1)*(x*y+x))^2-4*x*y*(x*y+x)^2)-1)/(2*x*y).
EXAMPLE
Triangle begins
0;
1, 1;
2, 4, 2;
3, 11, 13, 5;
4, 25, 51, 43, 13;
5, 49, 149, 203, 130, 32;
6, 86, 364, 716, 734, 382, 80;
7, 139, 787, 2099, 3061, 2521, 1105, 201;
PROG
(Maxima)
T(n, m):=sum(binomial(n-i+1, i-1)*binomial(n-i+1, i)*binomial(n-i+1, m-i+1), i, 0, n+1);
(PARI) T(n, m) = sum(i=0, n+1, binomial(n-i+1, i-1)*binomial(n-i+1, i)*binomial(n-i+1, m-i+1));
tabl(nn) = for (n=0, nn, for (k=0, n, print1(T(n, k), ", ")); print()); \\ Michel Marcus, Jan 19 2018
CROSSREFS
T(n,n) is A110320(n).
Sequence in context: A368434 A134400 A016095 * A349205 A181399 A349207
KEYWORD
nonn,tabl
AUTHOR
Vladimir Kruchinin, Jan 17 2018
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 May 27 02:08 EDT 2024. Contains 372847 sequences. (Running on oeis4.)