The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293373 Number of partitions of n where each part i is marked with a word of length i over a nonary alphabet whose letters appear in alphabetical order and all nine letters occur at least once in the partition. 2
 871030, 41488902, 1106315145, 22148014950, 366764207877, 5369282570448, 71433531608103, 887892874465104, 10433233718235522, 117558189248146187, 1278057588056171991, 13515236446777067727, 139538852470920866367, 1413457490580676488090, 14081562892529164704060 (list; graph; refs; listen; history; text; internal format)
 OFFSET 9,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 9..1000 FORMULA a(n) ~ c * 9^n, where c = 3.23950351986835655716873222462341048089067679826... - Vaclav Kotesovec, Oct 11 2017 MAPLE b:= proc(n, i, k) option remember; `if`(n=0, 1, `if`(i<1, 0,       b(n, i-1, k)+`if`(i>n, 0, b(n-i, i, k)*binomial(i+k-1, k-1))))     end: a:= n-> (k-> add(b(n\$2, k-i)*(-1)^i*binomial(k, i), i=0..k))(9): seq(a(n), n=9..30); CROSSREFS Column k=9 of A261719. Sequence in context: A166485 A034609 A182450 * A306868 A223886 A204509 Adjacent sequences:  A293370 A293371 A293372 * A293374 A293375 A293376 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 07 2017 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 16 23:43 EST 2022. Contains 350377 sequences. (Running on oeis4.)