A053733 a(n) = ceiling(binomial(n,9)/n).

0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 5, 19, 55, 143, 334, 715, 1430, 2702, 4862, 8398, 13997, 22610, 35530, 54480, 81719, 120175, 173587, 246675, 345345, 476905, 650325, 876525, 1168700, 1542684, 2017356, 2615092, 3362260, 4289780, 5433722

Offset: 1

Author

N. J. A. Sloane, Mar 25 2000

Keywords

• nonn

Links

• G. C. Greubel, Table of n, a(n) for n = 1..1000
• R. L. Graham and N. J. A. Sloane, Lower bounds for constant weight codes, IEEE Trans. Inform. Theory, 26 (1980), 37-43.
• Index entries for linear recurrences with constant coefficients, signature (8,-28,56,-70,56,-28,8,-1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,-8,28,-56,70,-56,28,-8,1).

Crossrefs

Cf. Sequences of the form ceiling(binomial(n,k)/n): A000012 (k=1), A004526 (k=2), A007997 (k=3), A008646 (k=5), A032192 (k=7), A053618 (k=4), A053643 (k=6), A053731 (k=8), this sequence (k=9).

Programs

Magma

[Ceiling(Binomial(n,9)/n): n in [1..40]]; // G. C. Greubel, Sep 06 2019

Maple

seq(ceil(binomial(n,9)/n), n=1..40); # G. C. Greubel, Sep 06 2019

Mathematica

Table[Ceiling[Binomial[n, 9]/n], {n, 40}] (* G. C. Greubel, Sep 06 2019 *)

PARI

vector(40, n, ceil(binomial(n,9)/n)) \\ G. C. Greubel, Sep 06 2019

Sage

[ceil(binomial(n,9)/n) for n in (1..40)] # G. C. Greubel, Sep 06 2019