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 A023092 #29 Jul 18 2025 16:45:20 %S A023092 0,113967,116397,1014138,1045638,1064538,1139148,1139670,1139967, %T A023092 1141398,1156392,1163970,1163997,10014138,10045638,10064538,10141380, %U A023092 10145628,10148913,10149138,10182564,10265382,10268145,10288836,10289637,10296387 %N A023092 Numbers k such that k and 8*k are anagrams. %C A023092 From _Robert G. Wilson v_, Oct 25 2012: (Start) %C A023092 10^(k-1) < a(n) < 10^k/8 for all n > 0 and some k. %C A023092 Number of terms < 10^k: 1, 1, 1, 1, 1, 3, 13, 92, 725, 5578, 41312, ... %C A023092 First term > 10^k: 113967, 1014138, 10014138, 100014138, 1000014138, 10000014138, 100000014138, ... %C A023092 First term < 10^k: 116397, 1163997, 12395169, 124839279, 1249839279, 12499839279, 124999839279, ... %C A023092 (End) %C A023092 All terms are divisible by 9. - _Eric M. Schmidt_, Jul 12 2014 %H A023092 David W. Wilson, <a href="/A023092/b023092.txt">Table of n, a(n) for n = 1..10001</a> %t A023092 fQ[n_] := Sort@ IntegerDigits[ n] == Sort@ IntegerDigits[ 8n]; Select[ Range[0, 10328885], fQ] (* _Robert G. Wilson v_, Oct 25 2012 *) %t A023092 Select[Range[0,103*10^5,9],Sort[IntegerDigits[#]]==Sort[IntegerDigits[8#]]&] (* _Harvey P. Dale_, Jul 18 2025 *) %Y A023092 Cf. A023086, A023087, A023088, A023089, A023090, A023091, A023093. %K A023092 nonn,base %O A023092 1,2 %A A023092 _David W. Wilson_