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 A276345 #6 Sep 03 2016 17:04:18 %S A276345 1,2,3,5,4,7,6,12,10,8,15,9,11,14,13,27,23,19,16,31,21,18,22,17,26,30, %T A276345 20,25,24,29,28,58,53,46,38,32,63,48,41,35,42,40,34,50,33,57,62,44,39, %U A276345 49,37,47,45,36,56,55,61,43,54,52,51,60,59,121,113,104,89,74,64,127,108,95,81,70,82,93,79,67,98,77,66,112,65,120 %N A276345 Permutation of natural numbers: a(1) = 1, a(A087686(1+n)) = A055938(a(n)), a(A088359(n)) = A005187(1+a(n)), where A088359 & A087686 = numbers that occur only once & more than once in A004001. %H A276345 Antti Karttunen, <a href="/A276345/b276345.txt">Table of n, a(n) for n = 1..8191</a> %H A276345 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A276345 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A276345 a(1) = 1; for n > 1, if A093879(n-1) = 0 [when n is in A087686], a(n) = A055938(a(A080677(n)-1)), otherwise [when n is in A088359], a(n) = A005187(1+a(A004001(n)-1)). %F A276345 As a composition of other permutations: %F A276345 a(n) = A233276(A276441(n)). %F A276345 a(n) = A233278(A267111(n)). %o A276345 (Scheme) %o A276345 (definec (A276345 n) (cond ((< n 2) n) ((zero? (A093879 (- n 1))) (A055938 (A276345 (+ -1 (A080677 n))))) (else (A005187 (+ 1 (A276345 (+ -1 (A004001 n)))))))) %Y A276345 Inverse: A276346. %Y A276345 Cf. A004001, A005187, A055938, A080677, A087686, A088359, A093879. %Y A276345 Similar or related permutations: A233276, A233278, A267111, A276343, A276441. %K A276345 nonn,base %O A276345 1,2 %A A276345 _Antti Karttunen_, Sep 03 2016