The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A050174 T(n,k) = S(n,k,k-2), 1<=k<=n-2, n >= 3, array S as in A050157. 0

%I #21 Aug 09 2021 01:30:01

%S 1,2,2,3,5,5,4,9,14,9,5,14,28,28,14,6,20,48,62,48,20,7,27,75,117,117,

%T 75,27,8,35,110,200,242,200,110,35,9,44,154,319,451,451,319,154,44,10,

%U 54,208,483,780,912,780,483,208,54,11,65,273,702,1274

%N T(n,k) = S(n,k,k-2), 1<=k<=n-2, n >= 3, array S as in A050157.

%C S(n,k,k) = C(n,k) for 1<=k<=n, n >= 1; cf. Pascal's triangle, A007318.

%C S(n,k,k-1), 1<=k<=n-1, n >= 2 is given by A014430.

%F T(n,k) = C(n,k) - n for k>1, and T(n, 1) = n - 2. - _Andrei Asinowski_, Jan 27 2016

%e Rows:

%e 1;

%e 2, 2;

%e 3, 5, 5;

%e 4, 9, 14, 9;

%e 5, 14, 28, 28, 14;

%e ...

%Y Cf. A007318, A014430.

%K nonn,tabl

%O 3,2

%A _Clark Kimberling_

%E Offset changed to 3 by _Michel Marcus_, Jan 29 2016

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 June 10 09:13 EDT 2024. Contains 373259 sequences. (Running on oeis4.)