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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027807 a(n) = 165*(n+1)*C(n+4,11)/4. 1

%I

%S 330,4455,32175,165165,675675,2342340,7147140,19691100,49884120,

%T 117781950,261891630,552882330,1115464350,2162284740,4045090500,

%U 7330194300,12907516050,22145248125,37105593525,60841155375,97796523825,154345534200,239501691000,365847510600

%N a(n) = 165*(n+1)*C(n+4,11)/4.

%C Number of 16-subsequences of [ 1, n ] with just 4 contiguous pairs.

%H T. D. Noe, <a href="/A027807/b027807.txt">Table of n, a(n) for n = 7..1000</a>

%F G.f.: 165*(2+x)*x^7/(1-x)^13.

%F a(n) = C(n+1, 8)*C(n+4, 4). - _Zerinvary Lajos_, May 26 2005, corrected by _R. J. Mathar_, Mar 16 2016

%t Table[165 (n + 1) Binomial[n + 4, 11]/4, {n, 7, 30}] (* or *) Table[Binomial[n + 1, 8] Binomial[n + 4, 4], {n, 7, 30}] (* _Michael De Vlieger_, Mar 16 2016 *)

%K nonn,easy

%O 7,1

%A thi ngoc dinh (via _R. K. Guy_)

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 4 14:51 EDT 2020. Contains 335448 sequences. (Running on oeis4.)