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 A276446 #7 Sep 03 2016 17:05:14 %S A276446 1,3,2,6,7,4,5,11,14,15,13,8,9,10,12,20,26,30,25,31,28,23,29,16,17,18, %T A276446 21,19,24,27,22,37,47,57,46,62,55,44,56,63,59,50,60,41,53,61,52,32,33, %U A276446 34,38,35,42,48,39,36,45,54,43,58,49,40,51,70,85,105,84,120,103,82,104,126,117,98,118,79,101,119,100,127,122,108,123,89 %N A276446 Permutation of natural numbers: a(1) = 1; a(A000069(1+n)) = A088359(a(n)), a(A001969(1+n)) = A087686(1+a(n)), where A088359 & A087686 = numbers that occur only once & more than once in A004001, and A000069 & A001969 are odious & evil numbers. %H A276446 Antti Karttunen, <a href="/A276446/b276446.txt">Table of n, a(n) for n = 1..8191</a> %H A276446 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %H A276446 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A276446 a(1) = 1, and for n > 1, if A010060(n) = 1 [when n is one of the odious numbers, A000069], a(n) = A088359(a(A115384(n)-1)), otherwise a(n) = A087686(1+a(A245710(n))). %F A276446 As a composition of other permutations: %F A276446 a(n) = A267112(A006068(n)). %o A276446 (Scheme) %o A276446 (definec (A276446 n) (cond ((< n 2) n) ((zero? (A010060 n)) (A087686 (+ 1 (A276446 (A245710 n))))) (else (A088359 (A276446 (- (A115384 n) 1)))))) %Y A276446 Inverse: A276445. %Y A276446 Cf. A000069, A001969, A004001, A010060, A087686, A088359, A115384, A245710. %Y A276446 Similar or related permutations: A006068, A267112, A276444. %K A276446 nonn,base %O A276446 1,2 %A A276446 _Antti Karttunen_, Sep 03 2016