Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Nov 09 2023 17:40:09
%S 0,2,1,4,6,8,3,10,12,14,5,16,18,20,7,22,24,26,9,28,30,32,11,34,36,38,
%T 13,40,42,44,15,46,48,50,17,52,54,56,19,58,60,62,21,64,66,68,23,70,72,
%U 74,25,76,78,80,27,82,84,86,29,88,90,92,31,94,96,98,33,100,102,104,35,106
%N Lodumo_2 transform of A159833.
%C Permutation of nonnegative integers.
%H Georg Fischer, <a href="/A160016/b160016.txt">Table of n, a(n) for n = 0..1000</a>
%H OEIS wiki, <a href="/wiki/Lodumo_transform">Lodumo transform</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%H <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,2,0,0,0,-1).
%F a(n) = lod_2(A159833(n)).
%F G.f.: x*(2*x^6+x^5+4*x^4+6*x^3+4*x^2+x+2) / (x^8-2*x^4+1).
%F a(n) = a(n-4) + (period 4: repeat [6, 6, 2, 6]) for n >= 4. - _Georg Fischer_, Feb 15 2019
%t LinearRecurrence[{0, 0, 0, 2, 0, 0, 0, -1}, {0, 2, 1, 4, 6, 8, 3, 10}, 100] (* _Georg Fischer_, Feb 15 2019 *)
%Y Cf. A159833.
%K easy,nonn
%O 0,2
%A _Philippe Deléham_, Apr 29 2009
%E Edited by _Georg Fischer_, Feb 15 2019