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.

A173191 a(n) = binomial(n + 6, 6)*9^n.

Original entry on oeis.org

1, 63, 2268, 61236, 1377810, 27280638, 491051484, 8207574804, 129269303163, 1939039547445, 27922169483208, 388371993720984, 5243021915233284, 68965903654222428, 886704475554288360, 11172476391984033336, 138259395350802412533, 1683511461036241140843
Offset: 0

Views

Author

Zerinvary Lajos, Feb 12 2010

Keywords

Comments

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

Crossrefs

Programs

Formula

a(n) = C(n + 6, 6)*9^n.
From Amiram Eldar, Aug 29 2022: (Start)
Sum_{n>=0} 1/a(n) = 1042074/5 - 1769472*log(9/8).
Sum_{n>=0} (-1)^n/a(n) = 5400000*log(10/9) - 2844729/5. (End)