29444

Appears in sequences

• a(n) = floor(10000*log(n)).at n=18A004243
• a(n) = 10000*log(n) rounded to nearest integer.at n=18A004244
• Let p(k) be the number of partitions of k (A000041); a(n) = Sum_{1<=k<=n, gcd(k,n)=1} p(k).at n=33A096223
• Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by two: p(i)<>i and (i-p(i) mod n <= 2 or p(i)-i mod n <= 2).at n=16A260074
• Sum of the fourth largest parts of the partitions of n into 9 parts.at n=44A326470
• Irregular triangle read by rows: T(n,k) = total number of graceful labelings of connected graphs with n edges (n>=1) and k vertices (k>=1).at n=50A329790
• Numbers k such that phi(k) and phi(k+1) are perfect powers (A001597).at n=50A332008
• Numbers k >= 0 such that the interval [A000217(k), A000217(k + 1)] contains at least one Fibonacci number (A000045).at n=42A388653