login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A059995 Drop the final digit of n. 24
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,21
LINKS
FORMULA
a(n) = a(n-10) + 1.
a(n) = floor(n/10).
a(n) = (n - A010879(n))/10.
G.f.: x^10/((1-x)(1-x^10)).
Partial sums are given by A131242. - Hieronymus Fischer, Jun 21 2007
MATHEMATICA
Table[FromDigits[Most[IntegerDigits[n]]], {n, 0, 110}] (* Harvey P. Dale, Sep 09 2016 *)
PROG
(PARI) a(n)=n\10+(n<0 && n%10) \\ Corrected by M. F. Hasler, May 19 2021
(PARI) { for (n=0, 1000, write("b059995.txt", n, " ", n\10); ) } \\ Harry J. Smith, Jul 01 2009
(PARI) a(n) = sign(n)*(abs(n)\10) \\ David A. Corneth, May 20 2021
(Python)
def A059995(n): return n//10 # Chai Wah Wu, Jan 20 2023
CROSSREFS
Sequence in context: A133880 A226233 A329624 * A132272 A179051 A324160
KEYWORD
base,easy,nonn
AUTHOR
Henry Bottomley, Mar 12 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:06 EDT 2024. Contains 371964 sequences. (Running on oeis4.)