cp's OEIS Frontend

A352760 Lexigraphically earliest sequence of distinct nonnegative integers such that for any n >= 0, among the ternary digits of n and a(n) (counted with multiplicity) there are as many 1's as 2's.

%I A352760 #16 Jul 09 2022 12:14:17
%S A352760 0,2,1,6,8,5,3,7,4,17,20,11,24,26,18,15,23,9,14,19,10,21,25,16,12,22,
%T A352760 13,35,53,29,56,62,47,33,51,27,60,74,54,78,80,71,59,72,44,45,61,32,65,
%U A352760 77,50,34,52,28,38,55,30,57,69,42,36,46,31,63,73,48,75,79
%N A352760 Lexigraphically earliest sequence of distinct nonnegative integers such that for any n >= 0, among the ternary digits of n and a(n) (counted with multiplicity) there are as many 1's as 2's.
%C A352760 This sequence is a self-inverse permutation of the nonnegative integers.
%H A352760 Rémy Sigrist, <a href="/A352760/b352760.txt">Table of n, a(n) for n = 0..6560</a>
%H A352760 Rémy Sigrist, <a href="/A352760/a352760.gp.txt">PARI program</a>
%H A352760 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A352760 a(n) = n iff n belongs to A039001.
%F A352760 a(n) < 3^k iff n < 3^k.
%e A352760 The first terms, alongside their ternary expansions, are:
%e A352760   n   a(n)  ter(n)  ter(a(n))
%e A352760   --  ----  ------  ---------
%e A352760    0     0       0          0
%e A352760    1     2       1          2
%e A352760    2     1       2          1
%e A352760    3     6      10         20
%e A352760    4     8      11         22
%e A352760    5     5      12         12
%e A352760    6     3      20         10
%e A352760    7     7      21         21
%e A352760    8     4      22         11
%e A352760    9    17     100        122
%e A352760   10    20     101        202
%e A352760   11    11     102        102
%e A352760   12    24     110        220
%o A352760 (PARI) See Links section.
%Y A352760 Cf. A004488, A039001 (fixed points), A331275, A355504.
%K A352760 nonn,base
%O A352760 0,2
%A A352760 _Rémy Sigrist_, Jul 05 2022