82029
domain: N
Appears in sequences
- Number of -n..n arrays x(0..5) of 6 elements with zero sum and no element more than one greater than the previous.at n=15A199850
- Integer nearest f(2^n), where f(x) = Sum of ( mu(k) * H(k)/k^(3/2) * Integral Log(x^(1/k)) ) for k = 1 to infinity, where H(k) is the harmonic number Sum_{i=1..k} 1/i.at n=19A201542
- Consider a decimal number of k>=2 digits x = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + ... + d_(2)*10 + d_(1) and the transform T(x)-> (d_(k)+d_(k-1) mod 10)*10^(k-1) + (d_(k-1)+d_(k-2) mod 10)*10^(k-2) + ... + (d_(2)+d_(1) mod 10)*10 + (d_(1)+d(k) mod 10). Sequence lists the numbers x such that T(x) divides x.at n=22A244286
- Number of vertices of type D at level n of the hyperbolic Pascal pyramid.at n=9A292293
- Number of n X n 0..1 arrays with every element unequal to 0, 1, 2 or 7 king-move adjacent elements, with upper left element zero.at n=7A304224
- Indices of primes of the form p = 2^i + 2^j + 1, i > j > 0 (A081091).at n=44A360448
- Least k such that the k-th prime number has exactly n zeros in its binary expansion.at n=18A372474