36951
domain: N
Appears in sequences
- Least number k such that k^n + k +/- 1 are twin primes, or 0 if no such k exists.at n=26A248081
- Starting at n, a(n) is the number of times we travel to a position 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=62A324674
- Average number of binary strings of length n with Levenshtein distance <= 3 from a uniform randomly sampled binary string of this length, rounded to nearest integer.at n=38A332918