24854

Appears in sequences

• a(n) = dot_product(1,2,...,n)*(4,5,...,n,1,2,3).at n=39A026040
• Number of asymmetric (identity) trees with n nodes and 4 leaves.at n=42A055335
• Expansion of 2*x*(7+16*x-2*x^2-14*x^3)/(1-11*x^2-12*x^3+10*x^4+12*x^5).at n=7A120711
• 3-comma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for three different splittings n=concat(S[0],S[1]).at n=30A166513
• Number of length n arrays of permutations of 0..n-1 with each element moved by -n to n places and the total absolute value of displacements not greater than n.at n=11A263932
• Number of length n arrays of permutations of 0..n-1 with each element moved by -6 to 6 places and the total absolute value of displacements not greater than n.at n=11A263937
• Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and the total absolute value of displacements not greater than n.at n=11A263938
• G.f.: Product_{n=-oo..+oo} ( 1 + x^n*(1 - x^n)^n ).at n=38A293602
• Regular triangle where T(n,k) is the number of multiset partitions of strongly normal multisets of size n into k blocks, where a multiset is strongly normal if it spans an initial interval of positive integers with weakly decreasing multiplicities.at n=51A317449