|
Search: id:A075798
|
|
|
| A075798 |
|
Triangle T(n,k) = f(n,k,n-1), n >= 0, 0 <= k <= n, where f is given below. |
|
+0
4
|
|
| 1, 1, 1, 1, 2, 1, 1, 6, 6, 1, 1, 12, 16, 12, 1, 1, 20, 35, 35, 20, 1, 1, 30, 66, 84, 66, 30, 1, 1, 42, 112, 175, 175, 112, 42, 1, 1, 56, 176, 328, 400, 328, 176, 56, 1, 1, 72, 261, 567, 819, 819, 567, 261, 72, 1, 1, 90, 370, 920, 1540, 1820, 1540, 920, 370, 90, 1, 1, 110, 506, 1419, 2706, 3696, 3696, 2706, 1419, 506, 110, 1, 1, 132, 672
(list; table; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
LINKS
|
Michel Lassalle, A new family of positive integers
|
|
FORMULA
|
f(n, p, k) = binomial(n, k)*hypergeom([1-k, -p, p-n], [1-n, 1], 1).
|
|
EXAMPLE
|
1; 1,1; 1,2,1; 1,6,6,1; ...
|
|
MAPLE
|
f := proc(n, p, k) convert( binomial(n, k)*hypergeom([1-k, -p, p-n], [1-n, 1], 1), `StandardFunctions`); end;
|
|
CROSSREFS
|
Cf. A014410 and A007318 for f(n,k,n), A075779 and A075798 for f(n,k,n-1) and A075780 and A075837 for f(n,k,n-2).
Sequence in context: A103880 A135899 A047920 this_sequence A009963 A008300 A137376
Adjacent sequences: A075795 A075796 A075797 this_sequence A075799 A075800 A075801
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas, Oct 17 2002
|
|
|
Search completed in 0.002 seconds
|
