50040

Appears in sequences

• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k returns to the x-axis.at n=23A108435
• Number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains a nonempty set of labels of equal size, also row sums of A143398.at n=8A143406
• Sum of all balanced numbers less than 10^n.at n=2A147842
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 1), (1, -1, -1), (1, 0, -1), (1, 1, 0)}.at n=10A148717
• Triangle T where the g.f. of row n of T^(2n) = (2n^2 + y)^n for n>=0, as read by rows, where T^n denotes the n-th matrix power of T.at n=10A177390
• Column 0 of triangle A177390.at n=4A177391
• Sum of absolute values of the character table of the symmetric group S_n.at n=10A214418
• Numbers k such that sigma(k - 2) = sigma(k + 2).at n=36A223091
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 155", based on the 5-celled von Neumann neighborhood.at n=41A270327
• a(n) is the smallest number k such that A362881(k) = n.at n=17A362909