52695

Appears in sequences

• Number of Section I primes between 2^n and 2^(n+1). See A135832.at n=48A135833
• Consider a number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that Sum_{i=1..k-1}{phi(Sum_{j=1..i}{d_(j)*10^(j-1)})} = Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=22A244069
• a(n) = 13*(2^n - 1) - 3*n^2 - 9*n.at n=11A257448
• Number of length n arrays of permutations of 0..n-1 with each element moved by -7 to 7 places and the average of every three consecutive elements is never greater than the median of the previous three elements.at n=21A263733