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 A367244 #5 Nov 12 2023 13:30:49
%S A367244 0,13,119,733,3815,18133,81599,354493,1504055,6278053,25904879,
%T A367244 106011853,431253095,1746686773,7051884959,28403182813,114200118935,
%U A367244 458563556293,1839545301839,7374058107373,29543870469575,118318410678613,473702458475519,1896096339905533,7588244995073015
%N A367244 a(n) is the number of n-digit numbers whose difference between the largest and smallest digits is equal to 3.
%C A367244 a(n) is the number of n-digit numbers in A366960.
%H A367244 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (9,-26,24).
%F A367244 a(n) = 27*4^(n-1) - 41*3^(n-1) + 7*2^n.
%F A367244 a(n) = 9*a(n-1) - 26*a(n-2) + 24*a(n-3) for n > 3.
%F A367244 O.g.f.: x^2*(13 + 2*x)/((1 - 2*x)*(1 - 3*x)*(1 - 4*x)).
%F A367244 E.g.f.: (exp(x) - 1)^2*(81*exp(2*x) - 2*exp(x) - 1)/12.
%t A367244 LinearRecurrence[{9,-26,24},{0,13,119},25]
%Y A367244 Cf. A366960.
%Y A367244 Cf. A000079, A000244, A000302.
%Y A367244 Cf. A367243, A367245, A367246, A367247, A367248, A367249, A367250.
%K A367244 nonn,base,easy
%O A367244 1,2
%A A367244 _Stefano Spezia_, Nov 11 2023