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 A264975 #11 Dec 06 2015 21:12:51 %S A264975 0,1,2,3,4,5,6,19,16,9,10,7,12,13,14,15,46,43,18,55,20,57,58,17,48,49, %T A264975 52,27,28,11,30,31,8,21,22,25,36,37,34,39,40,41,42,127,124,45,136,47, %U A264975 138,139,44,129,130,133,54,163,56,165,166,59,60,181,178,171,172,169,174,175,50,51,154,151,144,145,142,147,148,53,156,157,160,81 %N A264975 Permutation of nonnegative integers: a(n) = A264974(A263272(n)). %H A264975 Antti Karttunen, <a href="/A264975/b264975.txt">Table of n, a(n) for n = 0..9841</a> %H A264975 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a> %F A264975 a(n) = A264974(A263272(n)). %F A264975 a(n) = A263272(A264984(n)) / 2. %F A264975 a(n) = (1/4) * A264984(A264984(n)) = (1/4) * A263273(2 * A263273(2*n)). %F A264975 Other identities. For all n >= 0: %F A264975 a(3*n) = 3*a(n). %F A264975 A000035(a(n)) = A000035(n). [This permutation preserves the parity of n.] %o A264975 (Scheme, two alternative definitions) %o A264975 (define (A264975 n) (A264974 (A263272 n))) %o A264975 (define (A264975 n) (/ (A263273 (* 2 (A263273 (* 2 n)))) 4)) %Y A264975 Inverse: A264976. %Y A264975 Cf. A000035, A263272, A263273, A264974, A264984. %Y A264975 Cf. also A264991, A264992. %K A264975 nonn,base %O A264975 0,3 %A A264975 _Antti Karttunen_, Dec 05 2015