Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Dec 23 2024 14:53:45
%S 0,1,4,2,6,3,5,7,10,12,14,11,15,13,16,8,18,9,17,19,20,21,24,22,27,25,
%T 28,29,30,32,23,31,34,36,60,35,39,37,40,33,48,41,44,42,46,38,45,47,51,
%U 49,52,26,54,56,50,55,58,63,57,59,53,61,64,62,66,71,65,67,94,69,72,70,75,73,76,68,78,80,74,79,88,81,84,82,86,43
%N Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = 1+A193231(A193231(n)-1), where A193231(n) is blue code of n.
%H Antti Karttunen, <a href="/A302794/b302794.txt">Table of n, a(n) for n = 0..16383</a>
%H David Newman, et al., <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2018-January/018239.html">New sequences from old, Discussion on SeqFan-mailing list</a>, January 2018.
%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F a(0) = 0; for n >= 1, a(n) = 1+A193231(A193231(n)-1).
%o (PARI)
%o A193231(n) = { my(x='x); subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2) }; \\ From A193231
%o A302794(n) = if(!n,n,1+A193231(A193231(n)-1));
%Y Cf. A302793 (inverse).
%Y Cf. A193231.
%Y Cf. also A268718, A302028.
%K nonn,base
%O 0,3
%A _Antti Karttunen_, Apr 26 2018