|
%I #22 Mar 12 2020 09:44:43
%S 0,1,2,3,4,5,1,7,8,9,10,11,2,13,14,15,16,17,3,19,20,21,22,23,4,25,26,
%T 27,28,29,5,31,32,33,34,35,6,37,38,39,40,41,7,43,44,45,46,47,8,49,50,
%U 51,52,53,9,55,56,57,58,59,10,61
%N If n mod 6 = 0 then n/6 else n.
%H Jeremy Gardiner, <a href="/A214394/b214394.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_12">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,2,0,0,0,0,0,-1).
%F a(n) = 2*a(n-6) - a(n-12). - _G. C. Greubel_, Oct 26 2017 [corrected by _Georg Fischer_, Mar 12 2020]
%F a(n) = A244414(n) when n is not a multiple of 36 (A044102). - _Michel Marcus_, Oct 28 2017
%F a(n) = floor(n/6) + sign(n mod 6) * (n - floor(n/6)). - _Wesley Ivan Hurt_, Oct 28 2017
%e a(36) = 36/6 = 6.
%t Table[If[Mod[n, 6] == 0, n/6, n], {n, 0, 50}] (* _G. C. Greubel_, Oct 26 2017 *)
%o (PARI) a(n)=if(n%6,n,n/6) \\ _G. C. Greubel_, Oct 26 2017
%o (PARI) first(n) = my(res = vector(n, i, i-1)); forstep(i = 1, n, 6, res[i] \= 6); res \\ _David A. Corneth_, Oct 28 2017
%Y Cf. A026741, A051176, A214392.
%Y Cf. A044102, A244414.
%K nonn,easy
%O 0,3
%A _Jeremy Gardiner_, Jul 15 2012
|
