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.

A050494 Partial sums of A051923.

Original entry on oeis.org

1, 10, 52, 192, 570, 1452, 3300, 6864, 13299, 24310, 42328, 70720, 114036, 178296, 271320, 403104, 586245, 836418, 1172908, 1619200, 2203630, 2960100, 3928860, 5157360, 6701175, 8625006, 11003760, 13923712, 17483752, 21796720, 26990832, 33211200, 40621449
Offset: 0

Views

Author

Barry E. Williams, Dec 26 1999

Keywords

Comments

If Y is a 3-subset of an n-set X then, for n>=9, a(n-9) is the number of 9-subsets of X having at least two elements in common with Y. - Milan Janjic, Nov 23 2007

References

  • A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.

Crossrefs

Cf. A051923.
Cf. A093560 ((3, 1) Pascal, column m=7).

Programs

Formula

a(n)=C(n+6, 6)*(3n+7)/7.
G.f.: (1+2*x)/(1-x)^8.