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 A367246 #5 Nov 12 2023 13:31:23
%S A367246 0,9,139,1419,12079,92859,669319,4617699,30878959,201792939,
%T A367246 1295974999,8212422579,51499341439,320287850619,1978857202279,
%U A367246 12161478061059,74421280021519,453832688077899,2759692966903159,16742329188365139,101377580843991199,612894508749226779,3700556151386869639
%N A367246 a(n) is the number of n-digit numbers whose difference between the largest and smallest digits is equal to 5.
%C A367246 a(n) is the number of n-digit numbers in A366962.
%H A367246 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (15,-74,120).
%F A367246 a(n) = 29*6^(n-1) - 49*5^(n-1) + 5*4^n.
%F A367246 a(n) = 15*a(n-1) - 74*a(n-2) + 120*a(n-3) for n > 3.
%F A367246 O.g.f.: x^2*(9 + 4*x)/((1 - 4*x)*(1 - 5*x)*(1 - 6*x)).
%F A367246 E.g.f.: (145*exp(6*x) - 294*exp(5*x) + 150*exp(4*x) - 1)/30.
%t A367246 LinearRecurrence[{15,-74,120},{0,9,139},23]
%Y A367246 Cf. A366962.
%Y A367246 Cf. A000302, A000351, A000400.
%Y A367246 Cf. A367243, A367244, A367245, A367247, A367248, A367249, A367250.
%K A367246 nonn,base,easy
%O A367246 1,2
%A A367246 _Stefano Spezia_, Nov 11 2023