1011101
domain: N
Appears in sequences
- Numbers whose square is a palindrome.at n=41A002778
- Least positive multiple of n written in base 5 using only 0 and 1.at n=32A004285
- q-Catalan numbers (binomial version) for q=10.at n=3A015041
- Numbers k such that k^2 is a palindrome with an odd number of digits.at n=39A028816
- Sums of 5 distinct powers of 10.at n=9A038447
- Palindromes whose square is a palindrome; also palindromes whose sum of squares of digits is less than 10.at n=31A057135
- Palindromes only using 0 and 1 (i.e., base-2 palindromes).at n=18A057148
- In base 2: start with n; add to itself with digits reversed; if palindrome, stop; otherwise repeat; a(n) gives palindrome at which it stops, or -1 if no palindrome is ever reached.at n=31A062129
- Palindromes that are the sum of two shorter palindromes.at n=28A062696
- Working in base 2, replace n with the concatenation of its prime divisors in increasing order.at n=29A064841
- Working in base 2, replace n with the concatenation of its prime factors (without repetition).at n=29A065016
- a(1) = 1, a(n) = smallest palindrome not included earlier such that a(1)+...+a(n) is a palindrome.at n=45A073880
- Numbers n which in decimal have the form imj, where m is the middle digit, with property that j is the reversal of i, and i = m*j.at n=18A082945
- Palindromes n such that the n*m is also a palindrome, where m is the next palindrome after n.at n=33A083159
- Terms of A083393 such that the sum of the factorials of the digits is prime.at n=26A083394
- Triangle read by rows in which row n gives n smallest n-digit multiples of n that are palindromes.at n=23A084024
- a(n) = 93 written in base n.at n=1A095578
- a(n) = 93 written in base 15 - n.at n=13A095579
- Sequence A115793 in binary.at n=29A115794
- Sequence A115795 in binary.at n=17A115796