23211

Appears in sequences

• Squares written in base 5.at n=41A001740
• n written efficiently in natural numbers base, i.e., in form ...wxyz where n = 1*z + 2*y + 3*x + 4*w + ... with z <= 1, y < 2, x < 3, w < 4, ...at n=30A055611
• The zero-free, right-to-left factorial walk encoding for each rooted plane tree encoded by A014486. Sequence A071155 shown with factorial expansion (A007623).at n=34A071157
• Factorial codes for the fixed points of the square of Vaillé's 1997 bijection on Dyck paths.at n=9A126299
• A071158-codes for the fixed points of Vaillé's 1997 bijection on Dyck paths.at n=2A126301
• Numbers such that the digital sum base 2 and the digital sum base 3 and the digital sum base 10 all are equal.at n=23A135120
• a(n) = n*2^(n+1) + (2^(n+3)+(-1)^n)/3.at n=10A191007
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 307", based on the 5-celled von Neumann neighborhood.at n=32A271166
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 94", based on the 5-celled von Neumann neighborhood.at n=16A278822
• a(0) = 1; a(n) = 3 * Sum_{k=1..n} binomial(n,k) * a(k-1).at n=6A343975