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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241866 Number of compositions of n such that the smallest part has multiplicity six. 2
1, 0, 7, 7, 35, 63, 176, 371, 861, 1862, 4032, 8512, 17851, 36848, 75286, 152334, 305466, 607313, 1198443, 2348388, 4571728, 8846314, 17021480, 32579029, 62048589, 117627699, 222018034, 417326148, 781395064, 1457684326, 2709797693, 5020734691, 9273107977 (list; graph; refs; listen; history; text; internal format)
OFFSET
6,3
LINKS
Joerg Arndt and Alois P. Heinz, Table of n, a(n) for n = 6..1000
FORMULA
a(n) ~ n^6 * ((1+sqrt(5))/2)^(n-13) / (5^(7/2) * 6!). - Vaclav Kotesovec, May 02 2014
MAPLE
b:= proc(n, s) option remember; `if`(n=0, 1,
`if`(n<s, 0, expand(add(b(n-j, s)*x, j=s..n))))
end:
a:= proc(n) local k; k:= 6;
add((p->add(coeff(p, x, i)*binomial(i+k, k),
i=0..degree(p)))(b(n-j*k, j+1)), j=1..n/k)
end:
seq(a(n), n=6..40);
MATHEMATICA
b[n_, s_] := b[n, s] = If[n == 0, 1, If[n < s, 0, Expand[Sum[b[n - j, s]*x, {j, s, n}]]]]; a[n_] := With[{k = 6}, Sum[Function[{p}, Sum[Coefficient[p, x, i]*Binomial[i + k, k], {i, 0, Exponent[p, x]}]][b[n - j*k, j + 1]], {j, 1, n/k}]]; Table[a[n], {n, 6, 40}] (* Jean-François Alcover, Feb 09 2015, after Maple *)
CROSSREFS
Column k=6 of A238342.
Sequence in context: A290683 A339322 A121210 * A243123 A154702 A112685
KEYWORD
nonn
AUTHOR
Joerg Arndt and Alois P. Heinz, Apr 30 2014
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 15:48 EDT 2024. Contains 371780 sequences. (Running on oeis4.)