This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A262277 #7 Jan 22 2022 12:54:41 %S A262277 18,27,36,45,54,63,72,81,90,118,181,188,227,272,277,336,363,366,445, %T A262277 454,455,544,545,554,633,636,663,722,727,772,811,818,881,900,909,990, %U A262277 1089,1098,1118,1181,1188,1278,1287,1368,1386,1458,1485,1548,1584,1638 %N A262277 Numbers having in decimal representation the same distinct decimal digits as their 9's complement. %C A262277 If d is a digit of any term then also 9 - d; %H A262277 Reinhard Zumkeller, <a href="/A262277/b262277.txt">Table of n, a(n) for n = 1..10000</a> %F A262277 A227362(A061601(a(n))) = A227362(a(n)). %o A262277 (Haskell) %o A262277 import Data.List (nub, sort) %o A262277 a262277 n = a262277_list !! (n-1) %o A262277 a262277_list = filter f [1..] where %o A262277 f x = sort ds' == sort (map (9 -) ds') where %o A262277 ds' = nub $ ds x %o A262277 ds 0 = []; ds z = d : ds z' where (z', d) = divMod z 10 %o A262277 (PARI) isok(m) = my(d=digits(m), c=apply(x->9-x, d)); Set(d) == Set(c); \\ _Michel Marcus_, Jan 22 2022 %Y A262277 Cf. A061601, A227362, subsequences: A111708, A050278, A171102. %K A262277 nonn,base %O A262277 1,1 %A A262277 _Reinhard Zumkeller_, Sep 17 2015