cp's OEIS Frontend

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.

A277901 If A010060(n) = 1, a(n) = A065621(A115384(n)), otherwise a(n) = A048724(a(floor(n/2))).

This page as a plain text file.
%I A277901 #16 Nov 05 2016 07:27:11
%S A277901 1,2,3,7,6,5,4,13,9,10,14,15,11,8,12,25,23,27,26,30,31,28,18,17,21,22,
%T A277901 29,19,24,20,16,49,43,57,50,45,55,52,46,34,61,62,33,59,36,54,56,51,41,
%U A277901 42,63,47,58,39,44,37,53,40,38,60,35,32,48,97,83,125,98,75,103,100,86,119,109,110,89,107,92,114
%N A277901 If A010060(n) = 1, a(n) = A065621(A115384(n)), otherwise a(n) = A048724(a(floor(n/2))).
%C A277901 a(n) gives the number that is in the same position in array A277820 as where n is located in array A277880.
%H A277901 Antti Karttunen, <a href="/A277901/b277901.txt">Table of n, a(n) for n = 1..16383</a>
%H A277901 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A277901 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A277901 If A010060(n) = 1 [when n is one of the odious numbers, A000069], then a(n) = A065621(A115384(n)), otherwise a(n) = A048724(a(floor(n/2))).
%F A277901 As a composition of other permutations:
%F A277901 a(n) = A277820(A277881(n)).
%F A277901 Other identities. For all n >= 1:
%F A277901 A010060(a(n)) = A010060(n). [Preserves the parity of binary weight.]
%F A277901 a(A000069(n)) = A065621(n).
%F A277901 a(A003945(n)) = A001317(n).
%F A277901 a(A129771(n)) = A277823(n).
%F A277901 a(2*A129771(n)) = A277825(n).
%e A277901 The top left corner of array A277880 is:
%e A277901    1,  3,  6, 12
%e A277901    2,  5, 10, 20
%e A277901    4,  9, 18, 36
%e A277901    7, 15, 30, 60
%e A277901    8, 17, 34, 68
%e A277901 while the top left corner of A277820 is:
%e A277901    1,  3,  5, 15
%e A277901    2,  6, 10, 30
%e A277901    7,  9, 27, 45
%e A277901    4, 12, 20, 60
%e A277901   13, 23, 57, 75
%e A277901 thus a(1) = 1, a(2) = 2, a(3) = 3, a(4) = 7, a(5) = 6, a(6) = 5, a(7) = 4, a(8) = 13, a(9) = 9, a(12) = 15 and a(15) = 12.
%o A277901 (Scheme, with memoization-macro definec)
%o A277901 (definec (A277901 n) (if (= 1 (A010060 n)) (A065621 (A115384 n)) (A048724 (A277901 (floor->exact (/ n 2))))))
%o A277901 (define (A277901 n) (A277820 (A277881 n)))
%Y A277901 Inverse: A277902.
%Y A277901 Cf. A000069, A001969, A010060, A048724, A065621, A115384, A129771, A277823, A277825.
%Y A277901 Related permutations and arrays: A277820, A277880, A277881.
%K A277901 nonn,base
%O A277901 1,2
%A A277901 _Antti Karttunen_, Nov 03 2016