cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A027774 a(n) = (n+1)*binomial(n+1,14).

Original entry on oeis.org

14, 225, 1920, 11560, 55080, 220932, 775200, 2441880, 7034940, 18795370, 47070144, 111435000, 251100200, 541574100, 1123264800, 2249204040, 4362680250, 8220658275, 15085939200, 27020703600, 47327171760, 81198579000, 136666699200, 225962211600, 367443055800
Offset: 13

Views

Author

Thi Ngoc Dinh (via R. K. Guy)

Keywords

Comments

Number of 16-subsequences of [ 1, n ] with just 1 contiguous pair.

Programs

  • Mathematica
    Table[(n+1)Binomial[n+1,14],{n,13,40}] (* Harvey P. Dale, Nov 04 2017 *)

Formula

G.f.: (14+x)*x^13/(1-x)^16.
From Amiram Eldar, Jan 30 2022: (Start)
Sum_{n>=13} 1/a(n) = 107159834863/4637833200 - 7*Pi^2/3.
Sum_{n>=13} (-1)^(n+1)/a(n) = 7*Pi^2/6 + 125673472*log(2)/6435 - 62835162326017/4637833200. (End)