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 A266637 #8 Jan 30 2016 03:11:05 %S A266637 1,2,3,4,5,7,6,11,8,9,17,13,10,37,14,12,19,23,15,25,67,16,43,27,21,29, %T A266637 18,52,22,181,20,30,47,34,41,24,36,77,88,26,97,59,39,53,115,32,42,407, %U A266637 28,70,33,224,61,31,44,64,227,49,121,89,57,35,131,51,71,101,113,38,125,79,287,55,72,91,146,46,58,1361 %N A266637 a(1) = 1; for n > 1, if A192490(2*n + 1) = 1 [when 2n+1 is a Ludic number] a(n) = A003309(1+a(A266350(n)-1)), otherwise a(n) = A192607(a(n-A266350(n))). %H A266637 Antti Karttunen, <a href="/A266637/b266637.txt">Table of n, a(n) for n = 1..6121</a> %H A266637 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A266637 a(1) = 1; for n > 1, if A192490(2*n + 1) = 1 [when 2n+1 is Ludic number] a(n) = A003309(1+a(A266350(n)-1)), otherwise a(n) = A192607(a(n-A266350(n))). %F A266637 As a composition of related permutations: %F A266637 a(n) = A237126(A266417(n)). %o A266637 (Scheme, with memoization-macro definec) %o A266637 (definec (A266637 n) (cond ((<= n 1) n) ((zero? (A192490 (+ n n 1))) (A192607 (A266637 (- n (A266350 n))))) (else (A003309 (+ 1 (A266637 (+ -1 (A266350 n)))))))) %Y A266637 Inverse: A266638. %Y A266637 Cf. A003309, A192490, A192607, A266350. %Y A266637 Related or similar permutations: A237126, A266417. %K A266637 nonn %O A266637 1,2 %A A266637 _Antti Karttunen_, Jan 28 2016