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 A059995 #42 Dec 08 2024 12:26:09
%S A059995 0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,3,3,3,3,
%T A059995 3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,
%U A059995 6,6,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,10,10,10
%N A059995 Drop the final digit of n.
%H A059995 Harry J. Smith, <a href="/A059995/b059995.txt">Table of n, a(n) for n = 0..1000</a>
%H A059995 <a href="/index/Fi#final">Index entries for sequences related to final digits of numbers</a>
%H A059995 <a href="/index/Rec#order_11">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,0,0,0,0,0,0,1,-1).
%F A059995 a(n) = a(n-10) + 1.
%F A059995 a(n) = floor(n/10).
%F A059995 a(n) = (n - A010879(n))/10.
%F A059995 G.f.: x^10/((1-x)(1-x^10)).
%F A059995 Partial sums are given by A131242. - _Hieronymus Fischer_, Jun 21 2007
%t A059995 Table[FromDigits[Most[IntegerDigits[n]]],{n,0,110}] (* _Harvey P. Dale_, Sep 09 2016 *)
%o A059995 (PARI) a(n)=n\10+(n<0 && n%10) \\ Corrected by _M. F. Hasler_, May 19 2021
%o A059995 (PARI) a(n) = sign(n)*(abs(n)\10) \\ _David A. Corneth_, May 20 2021
%o A059995 (Python)
%o A059995 def A059995(n): return n//10 # _Chai Wah Wu_, Jan 20 2023
%Y A059995 Cf. A004526, A010879, A054899.
%K A059995 base,easy,nonn
%O A059995 0,21
%A A059995 _Henry Bottomley_, Mar 12 2001