25935

Appears in sequences

• Number of n-node rooted trees of height 3.at n=18A000235
• a(n) = binomial(n+3,6) + binomial(n+1,5) + binomial(n,5).at n=12A005732
• Odd primitive abundant numbers.at n=34A006038
• Total number of triangles visible in regular n-gon with all diagonals drawn.at n=12A006600
• Denominator of (2n+1)(2n+2) B_{2n}, where B_n are the Bernoulli numbers. Also denominators of the asymptotic expansion of the polygamma function psi'''(z).at n=37A006956
• a(n) is least k such that k and 5k are anagrams in base n (written in base 10).at n=14A023097
• Numbers k such that the least term in the periodic part of the continued fraction for sqrt(k) is 23.at n=6A031701
• Decimal part of cube root of a(n) starts with 6: first term of runs.at n=27A034132
• Numerators of continued fraction convergents to sqrt(951).at n=8A042840
• Odd numbers with exactly 5 distinct prime factors.at n=4A046391
• Numbers n such that the cyclotomic polynomial of order n has a nonzero coefficient which does not appear in any cyclotomic polynomials of lower order.at n=17A046887
• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n-1 <= 2^(p+1), starting with a(1) = a(2) = 1.at n=14A049943
• Maximal value of products of partitions of n into powers of distinct primes (powers of 1 and 2 excluded).at n=47A051704
• Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.at n=33A075460
• Lexicographically earliest increasing sequence of relatively prime numbers with nondecreasing number of divisors. a(0) = 1, tau(a(n+1)) >= tau(a(n)) and GCD(a(n),a(n+1)) = 1.at n=50A076963
• Means referred to in A093498.at n=12A093499
• Means referred to in A093498.at n=10A093499
• Odd squarefree abundant numbers.at n=4A112643
• Odd infinitary abundant numbers.at n=13A127666
• Odd unitary abundant numbers.at n=4A129485