This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A160016 #11 Nov 09 2023 17:40:09
%S A160016 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 A160016 13,40,42,44,15,46,48,50,17,52,54,56,19,58,60,62,21,64,66,68,23,70,72,
%U A160016 74,25,76,78,80,27,82,84,86,29,88,90,92,31,94,96,98,33,100,102,104,35,106
%N A160016 Lodumo_2 transform of A159833.
%C A160016 Permutation of nonnegative integers.
%H A160016 Georg Fischer, <a href="/A160016/b160016.txt">Table of n, a(n) for n = 0..1000</a>
%H A160016 OEIS wiki, <a href="/wiki/Lodumo_transform">Lodumo transform</a>
%H A160016 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%H A160016 <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 A160016 a(n) = lod_2(A159833(n)).
%F A160016 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 A160016 a(n) = a(n-4) + (period 4: repeat [6, 6, 2, 6]) for n >= 4. - _Georg Fischer_, Feb 15 2019
%t A160016 LinearRecurrence[{0, 0, 0, 2, 0, 0, 0, -1}, {0, 2, 1, 4, 6, 8, 3, 10}, 100] (* _Georg Fischer_, Feb 15 2019 *)
%Y A160016 Cf. A159833.
%K A160016 easy,nonn
%O A160016 0,2
%A A160016 _Philippe Deléham_, Apr 29 2009
%E A160016 Edited by _Georg Fischer_, Feb 15 2019