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!)
A059674 Square array a(m,n) = binomial(max(m,n), min(m,n)) (m>=0, n>=0) read by antidiagonals. 2

%I #17 Aug 18 2015 12:29:02

%S 1,1,1,1,1,1,1,2,2,1,1,3,1,3,1,1,4,3,3,4,1,1,5,6,1,6,5,1,1,6,10,4,4,

%T 10,6,1,1,7,15,10,1,10,15,7,1,1,8,21,20,5,5,20,21,8,1,1,9,28,35,15,1,

%U 15,35,28,9,1,1,10,36,56,35,6,6,35,56,36,10,1,1,11,45,84,70,21,1,21,70,84

%N Square array a(m,n) = binomial(max(m,n), min(m,n)) (m>=0, n>=0) read by antidiagonals.

%H T. D. Noe, <a href="/A059674/b059674.txt">Rows n = 0..100 of triangle, flattened</a>

%F Square array equals A007318 + transpose(A007318) - I, where I denotes the infinite identity matrix. - _Peter Bala_, Aug 11 2015

%e a(2,4) = binomial(max(2,4), min(2,4)) = binomial(4,2) = 6.

%e Square begins:

%e 1 1 1 1 1 1 ...

%e 1 1 2 3 4 5 ...

%e 1 2 1 3 6 10...

%e 1 3 3 1 4 10 ...

%t a[m_, n_] := If[m >= n, Binomial[m, n], Binomial[n, m]]; Table[a[m-n, n], {m, 0, 12}, {n, 0, m}] // Flatten (* _Jean-François Alcover_, Oct 10 2012 *)

%Y Cf. A007318.

%K easy,nice,nonn,tabl

%O 0,8

%A _Fabian Rothelius_, Feb 05 2001

%E More terms from Larry Reeves (larryr(AT)acm.org), Feb 06 2001

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 March 29 06:57 EDT 2024. Contains 371265 sequences. (Running on oeis4.)