|
%I #31 Mar 30 2023 02:34:20
%S 0,1,2,3,4,6,5,8,7,10,12,9,14,11,16,18,13,20,15,22,24,17,26,19,28,30,
%T 21,32,23,34,36,25,38,27,40,42,29,44,31,46,48,33,50,35,52,54,37,56,39,
%U 58,60,41,62,43,64,66,45,68,47,70,72,49,74,51,76,78,53,80
%N Permutation of nonnegative integers: a(n) = n + floor(n/5)*(-1)^(n mod 5).
%H Bruno Berselli, <a href="/A265734/b265734.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_10">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,2,0,0,0,0,-1).
%H <a href="/index/Per#IntegerPermutation">Index entries for permutations of the positive (or nonnegative) integers</a>.
%F G.f.: x*(1 + 2*x + 3*x^2 + 4*x^3 + 6*x^4 + 3*x^5 + 4*x^6 + x^7 + 2*x^8) / ((1 - x)^2*(1 + x + x^2 + x^3 + x^4)^2).
%F a(n) = 2*a(n-5) - a(n-10).
%F a(5*k+r) = (5+(-1)^r)*k + r, where r=0..4.
%F Sum_{n>=1} (-1)^(n+1)/a(n) = Pi*(1/(2*sqrt(2))-1/(3*sqrt(3))) + log(2)/6. - _Amiram Eldar_, Mar 30 2023
%e ------------------------------------------------------------------------
%e 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, ...
%e + + + + + + + + + + + + + + + + + + +
%e 0, 0, 0, 0, 0, 1, -1, 1, -1, 1, 2, -2, 2, -2, 2, 3, -3, 3, -3, ...
%e ------------------------------------------------------------------------
%e 0, 1, 2, 3, 4, 6, 5, 8, 7, 10, 12, 9, 14, 11, 16, 18, 13, 20, 15, ...
%e ------------------------------------------------------------------------
%t Table[n + Floor[n/5] (-1)^Mod[n, 5], {n, 0, 80}]
%o (Sage) [n+floor(n/5)*(-1)^mod(n, 5) for n in (0..80)]
%o (Magma) [n+Floor(n/5)*(-1)^(n mod 5): n in [0..80]];
%Y Cf. A001477.
%Y Cf. A064455: n+floor(n/2)*(-1)^(n mod 2).
%Y Cf. A265667: n+floor(n/3)*(-1)^(n mod 3).
%Y Cf. A265888: n+floor(n/4)*(-1)^(n mod 4)
%K nonn,easy
%O 0,3
%A _Bruno Berselli_, Dec 15 2015 - based on an idea by _Paul Curtz_.
|
