44781

Appears in sequences

• Number of rooted identity trees with n nodes and 3 leaves.at n=35A055328
• a(n) = n*(n-1)*(n^2 + 2)/6.at n=23A071244
• Number of B-trees of order infinity with n leaves, where a(n) = Sum_{k=1..floor(n/2)} a(k)*C(n-k-1,n-2*k) for n >= 2, with a(0)=0, a(1)=1.at n=21A119262
• The number of ways to color the vertices of all (11) simple unlabeled graphs on 4 nodes using at most n colors.at n=10A199394
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 193", based on the 5-celled von Neumann neighborhood.at n=42A270687
• a(n) = Sum_{i+j<=m+1} t_i * t_j, where t_1 < ... < t_m are the totatives of n.at n=45A341063