146300

Appears in sequences

• Number of tree-rooted planar maps with 3 faces and n vertices and no isthmuses.at n=18A006470
• Positive numbers k such that k and 3*k are anagrams in base 8 (written in base 8).at n=23A023074
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-2)/3.at n=27A048023
• Number of nonempty subsets of {1,2,...,n} in which exactly 3/5 of the elements are <= (n-3)/3.at n=27A048034
• Like A073327, but multiply the numerical values of the letters instead of adding them.at n=7A075831
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-4.at n=15A180294
• Number of n X n nonnegative integer arrays with each row and column increasing from zero by 0, 1 or 2.at n=4A202806
• Number of nX5 nonnegative integer arrays with each row and column increasing from zero by 0, 1 or 2.at n=4A202809
• T(n,k) = Number of n X k nonnegative integer arrays with each row and column increasing from zero by 0, 1 or 2.at n=40A202812
• Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of three indistinguishable pieces P on an n X n board.at n=9A222309
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=47A229534
• Number of defective 3-colorings of a 3 X n 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=7A229536
• Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 4.at n=16A244705
• a(n) = 2*A000447(n).at n=38A259110