|
%I #25 Mar 14 2024 15:28:03
%S 0,-1,-2,-3,-4,-5,-6,-7,-8,-9,1,0,-1,-2,-3,-4,-5,-6,-7,-8,2,1,0,-1,-2,
%T -3,-4,-5,-6,-7,3,2,1,0,-1,-2,-3,-4,-5,-6,4,3,2,1,0,-1,-2,-3,-4,-5,5,
%U 4,3,2,1,0,-1,-2,-3,-4,6,5,4,3,2,1,0,-1,-2,-3,7,6,5,4,3,2,1,0,-1,-2,8,7,6,5,4
%N a(n) = floor(n/10) - (n mod 10).
%C For n<100 equal to the negated alternating digital sum of n (see A055017). - _Hieronymus Fischer_, Jun 17 2007
%H Reinhard Zumkeller, <a href="/A076313/b076313.txt">Table of n, a(n) for n = 0..10000</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 From _Hieronymus Fischer_, Jun 17 2007: (Start)
%F a(n) = 11*floor(n/10)-n.
%F a(n) = (n-11*(n mod 10))/10.
%F a(n) = 11*A002266(A004526(n))-n=11*A004526(A002266(n))-n.
%F a(n) = (n-11*A010879(n))/10.
%F a(n) = (n-11*A000035(n)-22*A010874(A004526(n)))/10.
%F a(n) = (n-11*A010874(n)-55*A000035(A002266(n)))/10.
%F G.f.: x*(-8*x^10+11*x^9-1)/((1-x^10)*(1-x)^2). (End)
%t Table[Floor[n/10]-Mod[n,10],{n,0,100}] (* or *) LinearRecurrence[{1,0,0,0,0,0,0,0,0,1,-1},{0,-1,-2,-3,-4,-5,-6,-7,-8,-9,1},100] (* _Harvey P. Dale_, Nov 02 2022 *)
%o (PARI) a(n)=n\10-n%10 \\ _Charles R Greathouse IV_, Jan 30 2012
%o (Haskell)
%o a076313 = uncurry (-) . flip divMod 10 -- _Reinhard Zumkeller_, Jun 01 2013
%Y Cf. A076314, A010879, A076309, A076310, A076311, A076312, A055017, A076314, A007953, A003132.
%K sign,easy
%O 0,3
%A _Reinhard Zumkeller_, Oct 06 2002
|
