Sequences

Positive numbers k such that k and 2*k are anagrams in base 5 (written in base 5).

Positive numbers k such that k and 3*k are anagrams in base 5 (written in base 5).

Positive numbers k such that k and 4*k are anagrams in base 5 (written in base 5).

Positive numbers k such that k and 2*k are anagrams in base 6 (written in base 6).

Positive numbers k such that k and 3*k are anagrams in base 6 (written in base 6).

Positive numbers k such that k and 4*k are anagrams in base 6 (written in base 6).

Positive numbers k such that k and 5*k are anagrams in base 6 (written in base 6).

Positive numbers k such that k and 2*k are anagrams in base 7 (written in base 7).

Positive numbers k such that k and 3*k are anagrams in base 7 (written in base 7).

Positive numbers k such that k and 4*k are anagrams in base 7 (written in base 7).

Positive numbers k such that k and 5*k are anagrams in base 7 (written in base 7).

Positive numbers k such that k and 6*k are anagrams in base 7 (written in base 7).

Positive numbers k such that k and 2*k are anagrams in base 8 (written in base 8).

Positive numbers k such that k and 3*k are anagrams in base 8 (written in base 8).

Positive numbers k such that k and 4*k are anagrams in base 8 (written in base 8).

Positive numbers k such that k and 5*k are anagrams in base 8 (written in base 8).

Positive numbers k such that k and 6*k are anagrams in base 8 (written in base 8).

Positive numbers k such that k and 7*k are anagrams in base 8 (written in base 8).

Positive numbers k such that k and 2*k are anagrams in base 9 (written in base 9).

Positive numbers k such that k and 3*k are anagrams in base 9 (written in base 9).

Positive numbers k such that k and 4*k are anagrams in base 9 (written in base 9).

Positive numbers k such that k and 5*k are anagrams in base 9 (written in base 9).

Positive numbers k such that k and 6*k are anagrams in base 9 (written in base 9).

Positive numbers k such that k and 7*k are anagrams in base 9 (written in base 9).

Positive numbers k such that k and 8*k are anagrams in base 9 (written in base 9).

Numbers k such that k and 2*k are anagrams.

Numbers k such that k and 3*k are anagrams.

Numbers k such that k and 4*k are anagrams.

Numbers k such that k and 5*k are anagrams.

Numbers k such that k and 6*k are anagrams.

Numbers k such that k and 7*k are anagrams.

Numbers k such that k and 8*k are anagrams.

Numbers k such that k and 9*k are anagrams.

a(n) is least k such that k and 2k are anagrams in base n (written in base 10).

a(n) is the least k > 0 such that k and 3k are anagrams in base n (written in base 10).

Least k such that k and 4k are anagrams in base n (written in base 10).

a(n) is least k such that k and 5k are anagrams in base n (written in base 10).

a(n) is least k such that k and 6k are anagrams in base n (written in base 10).

a(n) is least k such that k and 7k are anagrams in base n (written in base 10).

a(n) is least k such that k and 8k are anagrams in base n (written in base 10).

a(n) is least k such that k and 9k are anagrams in base n (written in base 10).

a(n) is least k such that k and 10k are anagrams in base n (written in base 10).

(10^n)-th digit of infinite string 12345678910111213141516...

(2^n)-th digit of infinite string 12345678910111213141516...

Number of distinct quadratic residues mod 2^n.

a(n) is a power of the sum of its digits.

Largest integer in which every prefix is prime in base n (written in base 10).

Positive integers which apparently never result in a palindrome under repeated applications of the function A056964(x) = x + (x with digits reversed).

a(0) = 0. For n > 0, smallest non-palindromic number k such that the smallest palindrome in the Reverse and Add! trajectory of k is reached after exactly n iterations.

Squares which remain squares when the last digit is removed.