login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A027776
a(n) = (n+1)*binomial(n+1,16).
2
16, 289, 2754, 18411, 96900, 427329, 1641486, 5638611, 17651304, 51074375, 138105110, 352023165, 851809140, 1968053535, 4362680250, 9316746045, 19234572480, 38504502630, 74934688620, 142097513250, 263083395960, 476403662790, 845119028340, 1470739178610
OFFSET
15,1
COMMENTS
Number of 18-subsequences of [ 1, n ] with just 1 contiguous pair.
LINKS
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
Index entries for linear recurrences with constant coefficients, signature (18,-153,816,-3060,8568,-18564,31824,-43758,48620,-43758,31824,-18564,8568,-3060,816,-153,18,-1).
FORMULA
G.f.: (16+x)*x^15/(1-x)^18.
From Amiram Eldar, Jan 30 2022: (Start)
Sum_{n>=15} 1/a(n) = 107074439839/4058104050 - 8*Pi^2/3.
Sum_{n>=15} (-1)^(n+1)/a(n) = 4*Pi^2/3 + 684654592*log(2)/9009 - 30545942365399/579729150. (End)
MATHEMATICA
Table[(n + 1) Binomial[n + 1, 16], {n, 15, 100}] (* T. D. Noe, Mar 28 2012 *)
CROSSREFS
Sequence in context: A182608 A320763 A225194 * A140770 A099279 A202878
KEYWORD
nonn,easy
AUTHOR
Thi Ngoc Dinh (via R. K. Guy)
EXTENSIONS
Incorrect formula deleted. - R. J. Mathar, Feb 13 2016
STATUS
approved