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!)
A157694 Triangle read by rows: the Pascal triangle A007318 with all elements replaced by 1 which do not equal the central binomial coefficients. 0

%I #2 Mar 30 2012 17:34:34

%S 1,1,1,1,2,1,1,3,3,1,1,1,6,1,1,1,1,10,10,1,1,1,1,1,20,1,1,1,1,1,1,35,

%T 35,1,1,1,1,1,1,1,70,1,1,1,1,1,1,1,1,126,126,1,1,1,1,1,1,1,1,1,252,1,

%U 1,1,1,1

%N Triangle read by rows: the Pascal triangle A007318 with all elements replaced by 1 which do not equal the central binomial coefficients.

%C Row sums are {1, 2, 4, 8, 10, 24, 26, 76, 78, 260, 262,...}.

%F t(n,m)= binomial(n,[n/2]) if this equals binomial(n,m), else 1.

%e {1},

%e {1, 1},

%e {1, 2, 1},

%e {1, 3, 3, 1},

%e {1, 1, 6, 1, 1},

%e {1, 1, 10, 10, 1, 1},

%e {1, 1, 1, 20, 1, 1, 1},

%e {1, 1, 1, 35, 35, 1, 1, 1},

%e {1, 1, 1, 1, 70, 1, 1, 1, 1},

%e {1, 1, 1, 1, 126, 126, 1, 1, 1, 1},

%e {1, 1, 1, 1, 1, 252, 1, 1, 1, 1, 1}

%t Clear[t, n, m];

%t t[n_, m_] = If[ Binomial[n, m] == Binomial[n, Floor[n/2]], Binomial[n, Floor[n/2]], 1];

%t Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}];

%t Flatten[%]

%K nonn,easy,tabl

%O 0,5

%A _Roger L. Bagula_, Mar 04 2009

%E Edited by the Associate Editors of the OEIS, Apr 10 2009

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 September 13 20:16 EDT 2024. Contains 375910 sequences. (Running on oeis4.)