23200

Appears in sequences

• Number of binary rooted trees with n nodes and height at most 6.at n=23A036589
• 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=26A055992
• Number of solutions of x^10=1 in general affine group AGL(n,2).at n=3A063393
• Third binomial transform of Fibonacci(3n+2).at n=5A093132
• Structured octagonal prism numbers.at n=19A100176
• Numbers n such that pi(n^2)=pi((n-k)^2)+n, where k=A000193(n).at n=43A137271
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 3, read by rows.at n=29A157274
• Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = 2*k+1 if k <= floor(n/2) otherwise 2*(n-k)+1, and m = 3, read by rows.at n=34A157274
• A symmetrical triangle based on Narayana numbers and Eulerian numbers of type B: T(n, k) = 2 + A060187(n, k) - 2*binomial(n, k)*binomial(n+1, k)/(k+1).at n=24A176291
• Number of 4-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-bishop's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=23A187608
• E.g.f. A(x) satisfies: A(x) = exp( Integral A(x) * Integral 1/A(x)^2 dx dx ).at n=5A258662
• Number of irreducible polynomials occurring as the first component of a vertex in the Fibonacci zero tree, generated as in Comments.at n=23A262841
• Non-palindromic numbers n such that n * reverse(n) is a square and n and reverse(n) do not have the same number of digits.at n=35A322835
• Numbers k such that each of k, k+1, k+2, and k+4 is a sum of two squares.at n=32A328224
• The eventual period of a sequence b(n, m) where b(n, 1) = 1 and the m-th term is the number of occurrences of b(n, m-1) in the list of integers from b(n, max(m-n, 1)) to b(n, m-1).at n=28A334539
• Numbers with an equal number of deficient and abundant divisors.at n=34A335543
• a(n) = n + 2*binomial(n,2) + 3*binomial(n,3) + 4*binomial(n,4).at n=20A361099