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.

A276442 Permutation of natural numbers: a(1) = 1; a(2n) = A088359(a(n)), a(2n+1) = A087686(1+a(n)), where A088359 & A087686 = numbers that occur only once & more than once in A004001.

This page as a plain text file.
%I A276442 #12 Sep 03 2016 17:04:47
%S A276442 1,3,2,6,7,5,4,11,14,13,15,10,12,9,8,20,26,25,30,23,29,28,31,19,24,22,
%T A276442 27,18,21,17,16,37,47,46,57,44,56,55,62,41,53,52,61,50,60,59,63,36,45,
%U A276442 43,54,40,51,49,58,35,42,39,48,34,38,33,32,70,85,84,105,82,104,103,120,79,101,100,119,98,118,117,126,75,95,94
%N A276442 Permutation of natural numbers: a(1) = 1; a(2n) = A088359(a(n)), a(2n+1) = A087686(1+a(n)), where A088359 & A087686 = numbers that occur only once & more than once in A004001.
%C A276442 This sequence can be represented as a binary tree. Each left hand child is produced as A088359(n), and each right hand child as A087686(1+n), when their parent contains n:
%C A276442                                     |
%C A276442                  ...................1...................
%C A276442                 3                                       2
%C A276442       6......../ \........7                   5......../ \........4
%C A276442      / \                 / \                 / \                 / \
%C A276442     /   \               /   \               /   \               /   \
%C A276442    /     \             /     \             /     \             /     \
%C A276442   11      14         13       15         10       12          9       8
%C A276442 20  26  25  30     23  29   28  31     19  24   22  27      18 21   17 16
%C A276442 etc.
%C A276442 As in the mirror image permutation A267112, the level k of the tree contains all numbers of binary width k like many other base-2 related permutations (A003188, A054429, A233278, etc). For a proof, see A267110, which gives the contents of each parent node (for a node containing n > 1).
%H A276442 Antti Karttunen, <a href="/A276442/b276442.txt">Table of n, a(n) for n = 1..8191</a>
%H A276442 T. Kubo and R. Vakil, <a href="http://dx.doi.org/10.1016/0012-365X(94)00303-Z">On Conway's recursive sequence</a>, Discr. Math. 152 (1996), 225-252.
%H A276442 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A276442 <a href="/index/Ho#Hofstadter">Index entries for Hofstadter-type sequences</a>
%H A276442 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A276442 a(1) = 1; after which, a(2n) = A088359(a(n)), a(2n+1) = A087686(1+a(n)).
%F A276442 As a composition of other permutations:
%F A276442 a(n) = A267112(A054429(n)).
%F A276442 a(n) = A276344(A233278(n)).
%F A276442 a(n) = A276346(A233276(n)).
%F A276442 a(n) = A276444(A003188(n)).
%o A276442 (Scheme)
%o A276442 (definec (A276442 n) (cond ((< n 2) n) ((even? n) (A088359 (A276442 (/ n 2)))) (else (A087686 (+ 1 (A276442 (/ (- n 1) 2)))))))
%Y A276442 Inverse: A276441.
%Y A276442 Cf. A004001, A087686, A088359, A267110.
%Y A276442 Related or similar permutations: A003188, A054429, A233276, A233278, A267112, A276344, A276346, A276444.
%K A276442 nonn,base,tabf
%O A276442 1,2
%A A276442 _Antti Karttunen_, Sep 03 2016