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 A248209 #14 Sep 08 2022 08:46:10 %S A248209 54,243,297,432,486,621,675,810,864,1018,1143,1197,1225,1332,1386, %T A248209 1410,1443,1521,1522,1525,1571,1575,1577,1710,1764,1775,1810,1908, %U A248209 1918,1953,1997,2043,2097,2125,2232,2233,2286,2321,2332,2333,2421,2475,2521,2610 %N A248209 Numbers n such that n - A007953(n) contains the same distinct digits as n. %F A248209 a(n) ~ n. More specifically, a(n) - n = O(n^k * log n) with k = log 9/log 10. (This bound is not tight.) - _Charles R Greathouse IV_, Oct 12 2014 %o A248209 (PARI) %o A248209 for(n=1, 10^4, d=digits(n); if(vecsort(digits(n), , 8)==vecsort(digits(n-sumdigits(n)), , 8), print1(n, ", "))) %o A248209 (PARI) is(n)=Set(digits(n))==Set(digits(n-sumdigits(n))) \\ _Charles R Greathouse IV_, Oct 12 2014 %o A248209 (Magma) [n: n in [1..3000] | Set(Intseq(n-&+Intseq(n))) eq Set(Intseq(n))]; // _Bruno Berselli_, Oct 12 2014 %Y A248209 Cf. A247887 (similar, with n + A007953(n)). %K A248209 nonn,easy,base %O A248209 1,1 %A A248209 _Derek Orr_, Oct 03 2014