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 A260371 #27 Mar 07 2025 09:06:18
%S A260371 0,0,3,20,0,6,56,0,9,110,1848,12,208,210,270,272,0,124182,16017
%N A260371 a(n) = A260351(n) - A023811(n), where A260351 is the limit of the orbit of 0 under x -> x + (largest digit not in x) and A023811 is the largest metadrome, both in base n.
%C A260371 a(n) is a multiple of n-1.
%C A260371 Conjecture: a(3k+1) = 3k.
%H A260371 Wieb Bosma, Rene Bruin, Robbert Fokkink, Jonathan Grube, Anniek Reuijl, and Thian Tromp, <a href="https://arxiv.org/abs/2503.04122">Using Walnut to solve problems from the OEIS</a>, arXiv:2503.04122 [math.NT], 2025. See p. 3.
%e A260371 a(10) = 123456798 - 123456789 = 9.
%t A260371 Table[s = 0; t = 1; While[t != 0, t = Complement[Range[0, b - 1], IntegerDigits[s, b]][[-1]]; s = s + t]; s - Total[(#1 b^#2) & @@@ Transpose@ {Range[b - 1], Reverse@ (Range[b - 1] - 1)}], {b, 2, 8}] (* _Michael De Vlieger_, Jul 24 2015, after _Hans Havermann_ at A260351 *)
%Y A260371 Cf. A023811, A260351.
%K A260371 nonn,more,base
%O A260371 2,3
%A A260371 _Hans Havermann_, Jul 23 2015
%E A260371 a(14) from _Giovanni Resta_, Jul 24 2015
%E A260371 a(15)-a(22) from _Hiroaki Yamanouchi_, Aug 01 2015