43188

Appears in sequences

• A symmetrical triangle sequence:q=4;c(n,q)=Product[1 - q^i, {i, 1, n}];t(n,m,q)=-Eulerian[n + 1, m] + 2*c(n, q)/(c(m, q)*c(n - m, q)).at n=37A176429
• Number of rooted binary MUL-trees with n leaves on the label set [3].at n=7A220816
• Number of steps J. H. Conway's Fractran program needs to calculate the n-th prime.at n=10A267572
• a(n) = 54*n^2 - 78*n + 36.at n=29A277983
• The first Zagreb index of the Aztec diamond AZ(n) (see the Ramanes et al. reference, Theorem 2.1).at n=35A292344
• Decimal representation of binary numbers with string structure 10s00, s in {0,1}*, such that it results in a non-palindromic cycle of length 4 in the Reverse and Add! procedure in base 2.at n=25A306514
• a(n) is the decimal representation of the binary number with string structure 10s00, s in {0,1}*, such that it results in a non-palindromic cycle of length 4 in the Reverse and Add! procedure in base 2 and is not in the trajectory of any m < a(n).at n=7A306516
• Array read by antidiagonals: T(n,k) is the number of binary rooted trees with n leaves of k colors and all non-leaf nodes having out-degree 2.at n=52A319539