21331

Appears in sequences

• Integer part of log(n^n)^(1 + log(1 + log(n))).at n=21A062449
• Nearest integer to log(n^n)^(1 + log(1 + log(n))).at n=21A062450
• Fourth row of Pascal-(1,2,1) array A081577.at n=9A081584
• Number of solutions to n = Sum_{i=1..pi(n-1)} c(i)*p(i) with c(i) in {-1,0,1}, p(n) = n-th prime and pi = A000720.at n=43A215222
• Binomial transform of the partition numbers (A000041).at n=11A218481
• Number of n X n 0..4 arrays with rows in lexicographically nondecreasing order and columns in nonincreasing order.at n=2A229772
• T(n,k)=Number of n X n 0..k arrays with rows in lexicographically nondecreasing order and columns in nonincreasing order.at n=17A229774
• Number of 3 X 3 0..n arrays with rows in lexicographically nondecreasing order and columns in nonincreasing order.at n=3A229775
• Zeroless numbers k such that k - (sum of digits of k) and k - (product of digits of k) contain the same distinct digits as k.at n=3A248717
• Totient highly abundant numbers that are composite.at n=11A286322
• Numbers of the form HMMSS with primes H < 24 and MM, SS < 60, for which the number of seconds after midnight, 3600*H+60*MM+SS, is also prime.at n=30A295011
• Composite terms of A181659, where the sum of the iterated totient function attains a record.at n=5A332737
• Number of ways to write n as an ordered sum of 9 prime powers (including 1).at n=9A341138
• Numbers that are the sum of six fourth powers in five or more ways.at n=9A345562
• Numbers that are the sum of six fourth powers in exactly five ways.at n=8A345817
• Numbers that are the sum of eight fourth powers in exactly eight ways.at n=31A345840
• a(n) = Sum_{k=0..n} 3^k * binomial(n,k) * binomial(2*n+1,k).at n=4A388048