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 A026182 #6 Jan 31 2020 08:45:20 %S A026182 1,2,4,5,3,8,10,11,13,14,6,17,7,20,22,23,9,26,28,29,31,32,12,35,37,38, %T A026182 40,41,15,44,16,47,49,50,18,53,19,56,58,59,21,62,64,65,67,68,24,71,25, %U A026182 74,76,77,27,80,82,83,85,86,30,89,91,92,94 %N A026182 a(n) = (1/2)*(s(n) + 1), where s(n) is the n-th odd number in A026136. %C A026182 Also a(n) = (1/2)*s(n), where s(n) is the n-th even number in A026166. %H A026182 F. M. Dekking, <a href="https://arxiv.org/abs/2001.08915">Permutations of N generated by left-right filling algorithms</a>, arXiv:2001.08915 [math.CO], 2020. %Y A026182 Cf. A026166, A026136. %K A026182 nonn %O A026182 1,2 %A A026182 _Clark Kimberling_ %E A026182 Edited by _N. J. A. Sloane_, Jan 31 2020