57915

Appears in sequences

• Number of 4's in all partitions of n.at n=42A024788
• Expansion of 1/(1-3*x)^10; 10-fold convolution of A000244 (powers of 3).at n=4A036223
• There exists some k>0 such that n is the product of (k + digits of n).at n=20A055482
• a(n) = (n+1)*binomial(n+7, 7).at n=8A056001
• a(n) = Sum_{k=1..n} -mu(k+1) * a(n-k), with a(0)=1.at n=21A073776
• Consider all compositions (ordered partitions) of n into n parts, allowing zeros. E.g., for n = 3 we get 300, 030, 003, 210, 120, 201, 102, 021, 012, 111. Then a(n) is the total number of 1's.at n=8A097070
• Numbers n such that n=(d_1+4)*(d_2+4)*...*(d_k+4) where d_1 d_2 ... d_k is the decimal expansion of n.at n=5A098114
• a(n) = 3^4 * binomial(n+3, 4).at n=9A102741
• a(n) = binomial(n+8,n)*binomial(n+11,8).at n=2A105944
• a(n) = binomial(n+2,2)*binomial(n+5,5).at n=8A107417
• Numbers n>9 such that n=Abs[(c+d_1)*(c+d_2)*...*(c+d_k)] where d_1 d_2 ... d_k is the decimal expansion of n and c is an integer constant.at n=39A113756
• Exponential transform of C(n,7) = A000580.at n=15A145457
• Row sums of the extended Catalan triangle A189231.at n=15A189911
• 0 followed by the numerators of the reduced (A001803(n) + A001790(n)) / (2*A046161(n)).at n=9A206771
• Triangular array read by rows. T(n,k) is the number of labeled digraphs on n nodes with exactly k isolated nodes. 0<=k<=n.at n=23A217580
• a(n) = (2+[n/2])*n!/((1+[n/2])*[n/2]!^2).at n=15A275329
• G.f. A(x) = Sum_{n>=0} x^n/a(n) satisfies: A(x) = A(x^2) + Integral A(x^2) dx.at n=55A294640
• G.f. A(x) = Sum_{n>=0} x^n/a(n) satisfies: A(x) = A(x^2) + Integral A(x^2) dx.at n=110A294640
• Odd numbers k such that A162296(k) > 2*k.at n=36A357607
• Triangle read by rows: T(n, k) = binomial(k + n, k)*binomial(2*n - k, n).at n=37A371400