222211
domain: N
Appears in sequences
- n expressed in Fibonacci binary-like number system using only 1's and 2's.at n=26A108960
- Numbers for which the sum of reciprocals of square of digits is an integer.at n=26A182452
- Composite numbers n such that largest digit of all divisors of n is 2.at n=14A221698
- A base 3/2 reverse sorted Fibonacci sequence that starts with terms 2211 and 2211. The terms are interpreted as numbers written in base 3/2. To get a(n+2), add a(n) and a(n+1), write the result in base 3/2 and sort the digits into decreasing order, omitting all zeros.at n=4A305880
- A base 3/2 reverse sorted Fibonacci sequence that starts with terms 2211 and 2211. The terms are interpreted as numbers written in base 3/2. To get a(n+2), add a(n) and a(n+1), write the result in base 3/2 and sort the digits into decreasing order, omitting all zeros.at n=5A305880
- List of co-Lyndon words on {1,2} sorted first by length and then lexicographically.at n=21A329318
- Sequence S of positive integers such that the successive digits d of S are the successive Levenshtein distances between two adjacent terms of S. When possible, S is always extended with the smallest positive integer not yet present.at n=23A367638
- Lexicographically earliest sequence of distinct positive terms not ending in 0 such that the Levenshtein distance (Ld) between a(n) and a(n+1) is equal to the last digit of a(n).at n=52A367810