58682
domain: N
Appears in sequences
- Numbers k such that sopf(k) = sopf(k+3), where sopf(k) = A008472(k).at n=35A063969
- a(n) = (n^2 + 1) * (2*n - 1).at n=30A290631
- Squarefree integers m > 1 such that if prime p divides m, then s_p(m) >= p and s_p(m) == 2 (mod p-1), where s_p(m) is the sum of the base p digits of m.at n=13A324404
- Starting at n, a(n) is the number of times we move from a negative position to a spot we have already visited according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=25A324683
- a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} sigma( ( n/gcd(x_1, x_2, x_3, n) )^2 ).at n=7A373131