|
|
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
|
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,0,1,-1).
|
|
FORMULA
|
a(n) = a(n-10) + 1.
a(n) = floor(n/10).
G.f.: x^10/((1-x)(1-x^10)).
|
|
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
(Python)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|