OFFSET
1,2
COMMENTS
C(max(i,j),min(i,j))=number of {E,N,NE} paths from (0,0) to (i,j). Each step of a path is represented by (a,b)->(a+1,b) or (a,b)->(a,b+1) or (a,b)->(a+1,b+1). To include paths from (0,0) to points (a,0) and (0,b), see A059674.
EXAMPLE
Northwest corner:
1....2....3....4....5....6....7
2....1....3....6....10...15...21
3....3....1....4....10...20...35
4....6....4....1....5....15...35
5....10...10...5....1....6....21
MATHEMATICA
f[i_, j_] := Binomial[Max[i, j], Min[i, j]]
TableForm[Table[f[i, j], {i, 1, 10}, {j, 1, 10}]]
Flatten[Table[f[i, n + 1 - i], {n, 1, 14}, {i, 1, n}]]
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Jan 28 2012
STATUS
approved