23843

Appears in sequences

• Number of n-node rooted trees of height at most 6.at n=14A034823
• Basic numbers used in Sedgewick-Incerpi upper bound for shell sort.at n=11A036567
• Continued fraction expansion of a constant x such that the n-th partial quotient equals a(n) = floor(2^n*x), with a(0)=1.at n=14A093053
• Matrix square-root of triangle A105615.at n=30A105623
• Column 2 of triangle A105623.at n=5A105624
• Total area below all Schroeder paths of semilength n.at n=6A129180
• a(n) = 1 - 2*n^2 + 4*n*(1 + 2*n^2)/3.at n=21A168547
• Numbers n such that both n*Pi and n*e are within 1/sqrt(n) of integers.at n=41A208530
• Numbers m such that A338038(m) = A338038(A004086(m)) where A004086(i) is i read backwards and A338038(i) is the sum of the primes and exponents in the prime factorization of i ignoring 1-exponents; palindromes and multiples of 10 are excluded.at n=38A338039
• Numbers that are the sum of eight fourth powers in ten or more ways.at n=30A345585