112008domain: NAppears in sequencesa(n) is least k such that k and 5k are anagrams in base n (written in base 10).at n=34A023097Number of binary strings of length n avoiding 4-antipowers.at n=50A275061G.f. A(x) satisfies A(x) = 1 / (1 - x*A(x) / (1+x))^3.at n=7A371495