41700

Appears in sequences

• a(n) = ceiling(10000*log_2(n)).at n=17A004270
• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = a(3) = 1.at n=16A049933
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=9.at n=35A135194
• a(n) = n*(n+1)*(6*n-5)/2.at n=24A172082
• Expansion of psi(x^4) / phi(-x) in powers of x where phi(), psi() are Ramanujan theta functions.at n=25A187154
• Solution of the complementary equation a(n) = 2*a(n-2) - b(n-1) + n, where a(0) = 4, a(1) = 5, b(0) = 1, and (a(n)) and (b(n)) are increasing complementary sequences.at n=28A295068
• Exponential (2,3)-perfect numbers: numbers m such that esigma(esigma(m)) = 3m, where esigma(m) is the sum of exponential divisors of m (A051377).at n=37A328132