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 A217401 #23 Dec 07 2024 11:10:52 %S A217401 8,80,81,82,83,84,85,86,87,88,89,800,801,802,803,804,805,806,807,808, %T A217401 809,810,811,812,813,814,815,816,817,818,819,820,821,822,823,824,825, %U A217401 826,827,828,829,830,831,832,833,834,835,836,837,838,839,840,841,842 %N A217401 Numbers starting with 8. %C A217401 The lower and upper asymptotic densities of this sequence are 1/72 and 10/81, respectively. - _Amiram Eldar_, Feb 27 2021 %H A217401 Jeremy Gardiner, <a href="/A217401/b217401.txt">Table of n, a(n) for n = 1..1111</a> %H A217401 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>. %F A217401 a(n) = n + (71*10^floor(log_10(9*n-8))-8)/9. - _Alan Michael Gómez Calderón_, May 17 2023 %t A217401 Select[Range[1000], IntegerDigits[#][[1]] == 8 &] (* _T. D. Noe_, Oct 02 2012 *) %o A217401 (Python) %o A217401 def A217401(n): return n+(71*10**(len(str(9*n-8))-1))//9 # _Chai Wah Wu_, Dec 07 2024 %Y A217401 Cf. A000873, A011538. %Y A217401 Subsequences include: A045714, A077333, A106418, A106428. %Y A217401 Cf. A131835, A217394, A217395, A217397, A217398, A217399, A217400, A217402. %K A217401 nonn,base,easy %O A217401 1,1 %A A217401 _Jeremy Gardiner_, Oct 02 2012