352321536

Appears in sequences

• Number of rooted graphs on n labeled nodes where the root has degree 2.at n=5A038094
• a(n) = (n+1)*2^(n+4).at n=21A059165
• Number of ways of expressing an n-cycle in the symmetric group S_n as a product of n+1 transpositions.at n=7A060603
• The work performed by a function f:{1,...,n} -> {1,...,n} is defined to be work(f) = Sum_{i=1..n} |i - f(i)|; a(n) is equal to sum(work(f)) where the sum is over all functions f:{1,...,n}->{1,...,n}.at n=7A111868
• a(n)=4a(n-2).at n=25A137480
• a(0) = 9, a(n) = 2*a(n-1) + 2^(n-1) for n > 0.at n=24A159697
• a(n) = 21*2^n.at n=24A175805
• Expansion of x*(1 + x)/(1 - 2*x)^3.at n=21A276289
• Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.at n=30A285529
• Triangle read by rows: T(n,k) is the number of nodes of degree k counted over all simple labeled graphs on n nodes, n>=1, 0<=k<=n-1.at n=33A285529
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 457", based on the 5-celled von Neumann neighborhood.at n=28A288400
• Fixed points of A323710.at n=20A323752