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!)
A075780 Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below. 4

%I #9 Jan 14 2014 10:01:15

%S 0,3,3,12,14,12,30,45,45,30,60,114,138,114,60,105,245,357,357,245,105,

%T 168,468,808,960,808,468,168,252,819,1647,2286,2286,1647,819,252,360,

%U 1340,3090,4935,5740,4935,3090,1340,360,495,2079,5423,9834,13090,13090,9834,5423

%N Triangle T(n,k) = f(n,k,n-2), n >= 2, 1 <= k <= n-1, where f is given below.

%H Michel Lassalle, <a href="http://arXiv.org/abs/math.CO/0210208">A new family of positive integers</a>

%F f(n, p, k) = binomial(n, k)*hypergeom([1-k, -p, p-n], [1-n, 1], 1).

%p f := proc(n,p,k) convert( binomial(n,k)*hypergeom([1-k,-p,p-n],[1-n,1],1), `StandardFunctions`); end;

%t t[n_, k_] := n*(n-1)/2*HypergeometricPFQ[{-k, 3-n, k-n}, {1, 1-n}, 1]; Table[t[n, k], {n, 2, 12}, {k, 1, n-1}] // Flatten (* _Jean-François Alcover_, Jan 14 2014 *)

%Y 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).

%K nonn,tabl

%O 2,2

%A _N. J. A. Sloane_, Oct 17 2002

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 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)