0,5

Number of partitions of n into parts 1, 4, 7 and 8. - Ilya Gutkovskiy, May 18 2017

J. C. P. Miller, On the enumeration of partially ordered sets of integers, pp. 109-124 of T. P. McDonough and V. C. Mavron, editors, Combinatorics: Proceedings of the Fourth British Combinatorial Conference 1973. London Mathematical Society, Lecture Note Series, Number 13, Cambridge University Press, NY, 1974. The g.f. is G_{rot}(t) on page 122.

Ray Chandler, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (1,0,0,1,-1,0,1,0,-1,0,-1,0,1,0,-1,1,0,0,1,-1).

a(n) = floor((n^3 + 30*n^2 + 257*n + 1344)/1344 + ((n+7)/64)*(3*[(n mod 4)=0] - [(n mod 4)=2]) + (1/7)*([(n mod 56)=16] - [(n mod 56)=27])). - Hoang Xuan Thanh, Aug 01 2025

1/( (1-x)*(1-x^4)*(1-x^7)*(1-x^8) );

(PARI) a(n) = floor((n^3 + 30*n^2 + 257*n + 1344)/1344 + (n/64)*[3, 0, -1, 0][n%4+1] + (3/7)*((n%8==0) - (n%28==6) - (n%28==27))) \\ Hoang Xuan Thanh, Aug 01 2025

Sequence in context: A309256 A095972 A091974 * A376812 A058618 A135213

Adjacent sequences: A029070 A029071 A029072 * A029074 A029075 A029076

nonn,easy

approved