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 A346458 #15 Jul 20 2021 03:41:43 %S A346458 10,171,2748,43981,703710,11259375,180150010,2882400171,46118402748, %T A346458 737894443981,11806311103710,188900977659375,3022415642550010, %U A346458 48358650280800171,773738404492802748,12379814471884843981,198077031550157503710,3169232504802520059375 %N A346458 Numbers with hexadecimal representation A, AB, ABC, ..., ABCDEFA, ABCDEFAB, ... %H A346458 <a href="/index/Rec#order_07">Index entries for linear recurrences with constant coefficients</a>, signature (16,0,0,0,0,1,-16). %F A346458 a(n) = 16*a(n-1) + 10 + ((n - 1) mod 6) with a(1) = 10. %F A346458 From _Stefano Spezia_, Jul 19 2021: (Start) %F A346458 G.f.: x*(10 + 11*x + 12*x^2 + 13*x^3 + 14*x^4 + 15*x^5)/(1 - 16*x - x^6 + 16*x^7). %F A346458 a(n) = 16*a(n-1) + a(n-6) - 16*a(n-7) for n > 7. (End) %o A346458 (Haskell) a 1 = 10 %o A346458 a n = a (n - 1) * 16 + 10 + (n - 1) `mod` 6 %Y A346458 Cf. A325911. %K A346458 nonn,base,easy %O A346458 1,1 %A A346458 _Peter Andrew_, Jul 19 2021