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.

A065287 Infinite binary tree inspired permutation of N: 1 -> 3, 11ab..yz -> 11ab..yz1, 10ab..y0 -> 10ab..y, 10ab..y1 -> 11ab..y0.

This page as a plain text file.
%I A065287 #5 May 01 2014 02:42:47
%S A065287 3,1,7,2,6,13,15,4,12,5,14,25,27,29,31,8,24,9,26,10,28,11,30,49,51,53,
%T A065287 55,57,59,61,63,16,48,17,50,18,52,19,54,20,56,21,58,22,60,23,62,97,99,
%U A065287 101,103,105,107,109,111,113,115,117,119,121,123,125,127,32,96,33,98
%N A065287 Infinite binary tree inspired permutation of N: 1 -> 3, 11ab..yz -> 11ab..yz1, 10ab..y0 -> 10ab..y, 10ab..y1 -> 11ab..y0.
%C A065287 On the right side every node replaces its right child, on the left side the left children replace their parents and the right children are transferred to the same offset - 1 at the right side (becoming left children). See comment at A065263.
%H A065287 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%p A065287 RightChildTransferred_1 := proc(n) local k; if(1 = n) then RETURN(3); fi; k := floor_log_2(n)-1; if(3 = floor(n/(2^k))) then RETURN((2*n)+1); fi; if(0 = (n mod 2)) then RETURN(n/2); fi; RETURN(n + (2^k) - 1); end;
%Y A065287 A057114, A065263, A065269, A065275, A065281. Inverse: A065288, conjugated with A059893: A065289 and the inverse of that: A065290.
%K A065287 nonn
%O A065287 1,1
%A A065287 _Antti Karttunen_, Oct 28 2001