The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #12 Nov 10 2023 12:28:01
%S 17,28,39,60,71,82,93,106,117,127,137,147,157,160,167,171,172,173,174,
%T 175,176,177,206,217,228,238,248,258,260,268,271,278,282,283,284,285,
%U 286,287,288,306,317,328,339,349,359,360,369,371,379,382,389,393,394,395,396,397,398,399
%N Numbers whose difference between the largest and smallest digits is equal to 6.
%C The number of n-digit terms of this sequence is 27*7^(n-1) - 47*6^(n-1) + 4*5^n.
%t Select[Range[400],Max[d=IntegerDigits[#]]-Min[d]==6 &]
%o (Python)
%o def ok(n): return max(d:=list(map(int, str(n))))-min(d) == 6
%o print([k for k in range(400) if ok(k)]) # _Michael S. Branicky_, Oct 30 2023
%o (PARI) isok(n) = my(d=digits(n)); vecmax(d) - vecmin(d) == 6; \\ _Michel Marcus_, Nov 05 2023
%Y Cf. A037904.
%Y Cf. A010785 (difference = 0), A366958 (difference = 1), A366959 (difference = 2), A366960 (difference = 3), A366961 (difference = 4), A366962 (difference = 5), A366964 (difference = 7), A366965 (difference = 8), A366966 (difference = 9).
%K nonn,base,easy
%O 1,1
%A _Stefano Spezia_, Oct 30 2023