905969664

Appears in sequences

• a(0)=0, a(1)=1, a(n) = n*2^(n-2) for n >= 2.at n=27A057711
• Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 1.at n=18A074403
• Number of 4-ary Lyndon words of length n over Z_4 with trace 0 and subtrace 3.at n=18A074405
• Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 0.at n=18A074406
• Number of 4-ary Lyndon words of length n over Z_4 with trace 1 and subtrace 2.at n=18A074408
• Number of 4-ary Lyndon words of length n over Z_4 with trace 2 and subtrace 1.at n=18A074411
• Number of 4-ary Lyndon words of length n over Z_4 with trace 2 and subtrace 3.at n=18A074413
• a(1)=1, then a(n)=3*a(n-1) if n is already in the sequence, a(n)=2*a(n-1) otherwise.at n=28A079352
• Product of three solutions of the Diophantine equation x^2 - y^2 = z^3.at n=7A085482
• a(1) = 1; a(n+1) = a(n) * k(n), where k(n) is the number of elements of {a(j)}, 1<=j<=n, which are <= n.at n=17A094590
• Smallest number beginning with 9 and having exactly n prime divisors counted with multiplicity.at n=27A106429
• Least n-almost prime of the form semiprime + 1.at n=27A128665
• Binomial transform of A124625.at n=27A129952
• a(n) is the number of shapes of balanced trees with constant branching factor 4 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node.at n=30A131890
• a(n) = 27*2^n.at n=25A175806
• Number of n X 2 0..2 arrays with new values 0..2 introduced in row major order and no element equal to any knight-move neighbor (colorings ignoring permutations of colors).at n=14A208428
• Number of defective 3-colorings of an n X 2 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=13A229580
• Expansion of 1/Sum_{k>=0} A000326(k+1)*x^k.at n=28A296775
• Expansion of e.g.f. (1+x)*cosh(x)^2.at n=27A383608
• Expansion of e.g.f. cosh(x)^2*(x+x^2/2).at n=27A385601