|
%I #38 Jan 20 2023 15:14:13
%S 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 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 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 Drop the final digit of n.
%H Harry J. Smith, <a href="/A059995/b059995.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Fi#final">Index entries for sequences related to final digits of numbers</a>
%H <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 a(n) = a(n-10) + 1.
%F a(n) = floor(n/10).
%F a(n) = (n - A010879(n))/10.
%F G.f.: x^10/((1-x)(1-x^10)).
%F Partial sums are given by A131242. - _Hieronymus Fischer_, Jun 21 2007
%t Table[FromDigits[Most[IntegerDigits[n]]],{n,0,110}] (* _Harvey P. Dale_, Sep 09 2016 *)
%o (PARI) a(n)=n\10+(n<0 && n%10) \\ Corrected by _M. F. Hasler_, May 19 2021
%o (PARI) { for (n=0, 1000, write("b059995.txt", n, " ", n\10); ) } \\ _Harry J. Smith_, Jul 01 2009
%o (PARI) a(n) = sign(n)*(abs(n)\10) \\ _David A. Corneth_, May 20 2021
%o (Python)
%o def A059995(n): return n//10 # _Chai Wah Wu_, Jan 20 2023
%Y Cf. A004526, A010879, A054899.
%K base,easy,nonn
%O 0,21
%A _Henry Bottomley_, Mar 12 2001
|
