%I #12 Oct 02 2022 10:53:14
%S 0,1,2,3,4,5,6,7,8,9,10,12,11,13,14,15,16,17,18,21,19,22,24,26,20,23,
%T 25,28,27,29,30,31,32,33,34,38,35,39,42,45,36,40,43,48,46,50,52,54,37,
%U 41,44,49,56,47,51,57,53,58,55,60,59,61,62,63,64,65,66,71
%N Distinct values in A356784, in order of appearance.
%C We use offset 0 so as to have a permutation of the nonnegative integers.
%C See A357492 for the inverse.
%H Rémy Sigrist, <a href="/A357491/b357491.txt">Table of n, a(n) for n = 0..8191</a>
%H Rémy Sigrist, <a href="/A357491/a357491.png">Scatterplot of the first 2^21 terms</a>
%H Rémy Sigrist, <a href="/A357491/a357491.txt">C++ program</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F a(n) <= 2^k iff n <= 2^k for any k >= 0.
%F a(2^k) = 2^k for any k >= 0.
%e Table A357492 begins:
%e 0,
%e 0,
%e 0, 1,
%e 0, 1, 2, 3,
%e 0, 1, 2, 4, 3, 5, 6, 7,
%e 0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 7, 12, 11, 13, 14, 15,
%e ...
%e So the present sequence begins:
%e 0,
%e 1,
%e 2, 3,
%e 4, 5, 6, 7,
%e 8, 9, 10, 12, 11, 13, 14, 15,
%e ...
%o (C++) See Links section.
%Y Cf. A356784, A357492 (inverse).
%K nonn
%O 0,3
%A _Rémy Sigrist_, Oct 01 2022