220200
domain: N
Appears in sequences
- Łukasiewicz words for the rooted plane binary trees (interpretation d in Stanley's exercise 19) with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.at n=7A071152
- a(n) = number of length-n binary strings with A006697(n) distinct substrings.at n=28A134457
- Numbers k such that k and k^2 use only the digits 0, 2, 4 and 8.at n=35A136908
- Numbers k such that k^2 has only digits 0, 4 and 8.at n=39A202170
- Let x(0)x(1)x(2)... x(q) denote the decimal expansion of n. Sequence lists the numbers n such that the suffix of decimal expansion x(2)... x(q) is the p-th divisor of n where p is the prefix of decimal expansion x(0)x(1).at n=23A234315