login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A373931
Number of compositions of 7*n-5 into parts 1 and 7.
4
1, 4, 17, 83, 413, 2037, 10010, 49183, 241722, 1188097, 5839638, 28702296, 141073905, 693388850, 3408058991, 16750869834, 82331801783, 404667078256, 1988969518921, 9775936716973, 48049473757425, 236166824233838, 1160777933797328, 5705311980035178
OFFSET
1,2
FORMULA
a(n) = A005709(7*n-5).
a(n) = Sum_{k=0..n} binomial(n+1+6*k,n-1-k).
a(n) = 8*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7).
G.f.: x*(1-x)^4/((1-x)^7 - x).
a(n) = n*(1 + n)*hypergeom([1-n,(2+n)/6, (3+n)/6, (4+n)/6, (5+n)/6, 1+n/6, (7+n)/6], [3/7, 4/7, 5/7, 6/7, 8/7, 9/7], -6^6/7^7)/2. - Stefano Spezia, Jun 23 2024
MATHEMATICA
a[n_]:=n*(1 + n)*HypergeometricPFQ[{1-n, (2+n)/6, (3+n)/6, (4+n)/6, (5+n)/6, 1+n/6, (7+n)/6}, {3/7, 4/7, 5/7, 6/7, 8/7, 9/7}, -6^6/7^7]/2; Array[a, 24] (* Stefano Spezia, Jun 23 2024 *)
PROG
(PARI) a(n) = sum(k=0, n, binomial(n+1+6*k, n-1-k));
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Jun 23 2024
STATUS
approved