39751

Appears in sequences

• Number of decimal digits in n-th Mersenne prime.at n=29A028335
• Number of digits in n-th even superperfect number A061652(n).at n=29A138883
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 0, 1), (-1, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=9A149293
• Odd numbers n>5 in the representation n=2*p+q, p, q prime, q maximal, at which a larger p than for any smaller n is needed. A195354 gives values of p.at n=11A195353
• Number of n X 2 0..1 arrays with no element less than a strict majority of its horizontal and vertical neighbors.at n=11A231376
• Integers that reach the (47360, 29127) cycle described in A234534, after iterations of numerator(sigma(n)/n) = A017665(n).at n=11A249614
• Number of (n+2)X(3+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=6A262754
• T(n,k) = Number of (n+2) X (k+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=42A262759
• Number of (7+2)X(n+2) 0..1 arrays with each row divisible by 5 and each column divisible by 7, read as a binary number with top and left being the most significant bits.at n=2A262764
• Numbers m such that numbers m, m + 1, m + 2 and m + 3 have k, 2k, 3k and 4k divisors respectively.at n=24A340157