cp's OEIS Frontend

A168223 a(n) = A006369(n) - A006368(n).

%I A168223 #24 Mar 14 2024 15:08:38
%S A168223 0,0,0,0,-1,3,-5,4,-1,-1,-2,7,-10,7,-2,-1,-3,10,-15,11,-3,-2,-4,14,
%T A168223 -20,14,-4,-2,-5,17,-25,18,-5,-3,-6,21,-30,21,-6,-3,-7,24,-35,25,-7,
%U A168223 -4,-8,28,-40,28,-8,-4,-9,31,-45,32,-9,-5,-10,35,-50,35,-10,-5,-11,38,-55,39
%N A168223 a(n) = A006369(n) - A006368(n).
%C A168223 A047342 and A168223 give record values and where they occur: a(A168224(n))=A047342(n) and a(m) < A047342(n) for m < A168224(n).
%H A168223 Reinhard Zumkeller, <a href="/A168223/b168223.txt">Table of n, a(n) for n = 0..10000</a>
%H A168223 <a href="/index/3#3x1">Index entries for sequences related to 3x+1 (or Collatz) problem</a>
%H A168223 <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (-2,-2,0,3,4,3,0,-2,-2,-1).
%F A168223 a(12*n) = -10*n,          a(12*n+1) = 7*n.
%F A168223 a(12*n+2) = -2*n,         a(12*n+3) = -n.
%F A168223 a(12*n+4) = -2*n - 1,     a(12*n+5) = 7*n + 3.
%F A168223 a(12*n+6) = -10*n - 5,    a(12*n+7) = 7*n + 4.
%F A168223 a(12*n+8) = -2*n -1,      a(12*n+9) = -n - 1.
%F A168223 a(12*n+10) = -2*n - 2,    a(12*n+11) = 7*n + 7.
%F A168223 G.f.: -x^4*(x^2-x+1) / ((x-1)^2*(x+1)^2*(x^2+1)*(x^2+x+1)^2). - _Colin Barker_, Apr 04 2013
%t A168223 LinearRecurrence[{-2,-2,0,3,4,3,0,-2,-2,-1},{0, 0, 0, 0, -1, 3, -5, 4, -1, -1},50] (* _G. C. Greubel_, Jul 16 2016 *)
%o A168223 (Haskell)
%o A168223 a168223 n = a006369 n - a006368 n  -- _Reinhard Zumkeller_, Mar 15 2014
%K A168223 sign,easy,look
%O A168223 0,6
%A A168223 _Reinhard Zumkeller_, Nov 20 2009