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!)
A027775 a(n) = (n+1)*binomial(n+1, 15). 2
15, 256, 2312, 14688, 73644, 310080, 1139544, 3751968, 11277222, 31380096, 81719000, 200880160, 469364220, 1048380480, 2249204040, 4653525600, 9316746045, 18103127040, 34226224560, 63102895680, 113678010600, 200444492160, 346475391120, 587908889280 (list; graph; refs; listen; history; text; internal format)
OFFSET
14,1
COMMENTS
Number of 17-subsequences of [ 1, n ] with just 1 contiguous pair.
LINKS
Vincenzo Librandi and T. D. Noe, Table of n, a(n) for n = 14..1000 (first 300 terms from Vincenzo Librandi)
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 (17,-136,680,-2380,6188,-12376,19448,-24310,24310,-19448,12376,-6188,2380,-680,136,-17,1).
FORMULA
G.f.: x^14*(15+x)/(1-x)^17.
From Amiram Eldar, Jan 30 2022: (Start)
Sum_{n>=14} 1/a(n) = 5*Pi^2/2 - 106497287263/4328644320.
Sum_{n>=14} (-1)^n/a(n) = 5*Pi^2/4 + 115552256*log(2)/3003 - 16500694723831/618377760. (End)
MATHEMATICA
Table[(n+1)Binomial[n+1, 15], {n, 14, 40}] (* Harvey P. Dale, Jul 26 2011 *)
PROG
(Magma) [(n+1)*Binomial(n+1, 15): n in [14..30]]; // Vincenzo Librandi, Jul 27 2011
CROSSREFS
Sequence in context: A218238 A015691 A145562 * A334995 A099273 A206230
KEYWORD
nonn
AUTHOR
Thi Ngoc Dinh (via R. K. Guy)
EXTENSIONS
Offset corrected by Harvey P. Dale, Jul 26 2011
STATUS
approved

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 April 25 09:22 EDT 2024. Contains 371967 sequences. (Running on oeis4.)