The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A205549 Symmetric matrix by antidiagonals: C(max(i+2,j+2),min(i+2,j+2)), i>=1, j>=1. 0

%I

%S 1,4,4,10,1,10,20,5,5,20,35,15,1,15,35,56,35,6,6,35,56,84,70,21,1,21,

%T 70,84,120,126,56,7,7,56,126,120,165,210,126,28,1,28,126,210,165,220,

%U 330,252,84,8,8,84,252,330,220,286,495,462,210,36,1,36,210,462

%N Symmetric matrix by antidiagonals: C(max(i+2,j+2),min(i+2,j+2)), i>=1, j>=1.

%e Northwest corner:

%e 1....4....10...20...35

%e 4....1....5....15...35

%e 10...5....1....6....21

%e 20...15...6....1....7

%t g[k_] := k + 2;

%t f[i_, j_] := Binomial[Max[g[i], g[j]], Min[g[i], g[j]]]

%t TableForm[Table[f[i, j], {i, 1, 10}, {j, 1, 10}]]

%t Flatten[Table[f[i, n + 1 - i], {n, 1, 14}, {i, 1, n}]]

%Y Cf. A205456, A205548.

%K nonn,tabl

%O 1,2

%A _Clark Kimberling_, Jan 28 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 27 07:28 EST 2021. Contains 349365 sequences. (Running on oeis4.)