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.

A173192 a(n) = binomial(n + 7, 7)*9^n.

Original entry on oeis.org

1, 72, 2916, 87480, 2165130, 46766808, 911952756, 16415149608, 277005649635, 4432090394160, 67810983030648, 998670840996816, 14231059484204628, 197045439012064080, 2660113426662865080, 35113497231949819056, 454280870438350784037, 5772039294981398197176
Offset: 0

Views

Author

Zerinvary Lajos, Feb 12 2010

Keywords

Comments

Number of n-permutations (n>=7) of 10 objects p, r, q, u, v, w, z, x, y, z with repetition allowed, containing exactly 7 u's.

Crossrefs

Programs

Formula

a(n) = C(n + 7, 7)*9^n.
From Amiram Eldar, Aug 29 2022: (Start)
Sum_{n>=0} 1/a(n) = 16515072*log(9/8) - 19451943/10.
Sum_{n>=0} (-1)^n/a(n) = 63000000*log(10/9) - 13275423/2. (End)