69552

Appears in sequences

• Triangle of D'Arcais numbers.at n=41A008298
• Jabotinsky-triangle related to A039647.at n=41A039692
• Signed triangle of D'Arcais numbers (A008298) : coefficients of r in the polynomials generated by the series coefficients of z^n in Product[(1-z^k)^r, {k,1,Inf}]*(n!).at n=51A078521
• Triangle read by rows: T(n,k) is the number of permutations p of [n] such that the length of the longest 2-stack sortable initial segment of p is equal to k.at n=40A094785
• Sum of largest parts of all compositions of n.at n=14A102712
• Number of forests of labeled rooted trees with n nodes, containing exactly 2 trees of height one, all others having height zero.at n=9A133386
• Triangle T(n,k)=number of forests of labeled rooted trees with n nodes, containing exactly k trees of height one, all others having height zero (n>=0, 0<=k<=floor(n/2)).at n=27A133399
• a(n) = 4*a(n-1)+a(n-2), n>2; a(0)=1, a(1)=3, a(2)=12.at n=8A155179
• Numbers with prime factorization pqr^3s^4.at n=22A190294
• Triangle read by rows: coefficients of polynomials p(x,n) defined by 1/(1-t-t^2)^x = Sum_{n=1..oo} p(x,n)*t^n/n!.at n=51A194938
• Series reversion of (1 - t*x)*log(1 + x) with respect to x.at n=30A198204
• Irregular triangular array read by rows. T(n,k) is the number of n-permutations with exactly k distinct cycle lengths; n>=1, 1<=k<=floor( (-1+(1+8n)^(1/2))/2 ).at n=19A224211
• Number of length 3 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=40A244834
• (1+e)-sigma amicable numbers.at n=22A274116
• Average of amicable pairs (x,y), ordered by the smaller value x given in A002025.at n=8A275315
• Average of amicable pairs (x,y), ordered by the sum x+y given in A259953.at n=10A275316
• Expansion of x*(1 - x + 2*x^3 - x^4)/((1 - x)*(1 + x)*(1 - x + x^2)*(1 - x - x^2)).at n=24A279890
• a(n) = 2*a(n-1) - a(n-2) + a(n-4), n>3, a(0)=0, a(1)=a(2)=1, a(3)=3.at n=24A286311
• a(n) = 2*a(n-1) - a(n-2) + a(n-4) for n>3, a(0)=0, a(1)=a(2)=2, a(3)=3.at n=24A286350
• Numbers k such that k = Product (p_j^e_j) = Product (pi(p_j)*p_j), where pi() = A000720.at n=33A304194