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!)
A194119 Triangular array: T(n,k)=C(n+3,k)+C(n+3,k+3), 0<=k<=n. 4

%I #5 Mar 30 2012 18:57:40

%S 2,5,5,11,10,11,21,21,21,21,36,42,42,42,36,57,78,84,84,78,57,85,135,

%T 162,168,162,135,85,121,220,297,330,330,297,220,121,166,341,517,627,

%U 660,627,517,341,166,221,507,858,1144,1287,1287,1144,858,507,221

%N Triangular array: T(n,k)=C(n+3,k)+C(n+3,k+3), 0<=k<=n.

%e Northwest corner:

%e 2

%e 5...5

%e 11...10...11

%e 21...21...21...21

%e 36...42...42...36

%e 57...78...84...84...78...56

%t T[n_, k_] := Binomial[n + 3, k] + Binomial[n + 3, k + 3]

%t Flatten[Table[T[n, k], {n, 0, 10}, {k, 0, n}]]

%t (* A194119 as a sequence *)

%t TableForm[Table[T[n, k], {n, 0, 10}, {k, 0, n}]]

%t (* A194119 as an array *)

%Y Cf. A007318, A194118, A194120.

%K nonn,tabl

%O 0,1

%A _Clark Kimberling_, Aug 16 2011

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 23 05:59 EDT 2024. Contains 371906 sequences. (Running on oeis4.)