The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A302028 Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = 1+A057889(A057889(n)-1), where A057889 is a bijective bit-reverse. 3

%I

%S 0,1,2,3,4,5,6,7,8,9,10,13,14,11,12,15,16,17,18,25,26,21,20,29,30,19,

%T 22,23,28,27,24,31,32,33,34,49,50,41,36,57,58,37,38,45,52,53,40,61,62,

%U 35,42,39,54,43,44,47,60,51,46,55,56,59,48,63,64,65,66,97,98,81,68,113,114,73,70,89,100,105,72,121,122,69,74,77,102,85,76

%N Permutation of nonnegative integers: a(0) = 0; for n >= 1, a(n) = 1+A057889(A057889(n)-1), where A057889 is a bijective bit-reverse.

%H Antti Karttunen, <a href="/A302028/b302028.txt">Table of n, a(n) for n = 0..16383</a>

%H David Newman, et al, <a href="http://list.seqfan.eu/pipermail/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+A057889(A057889(n)-1).

%o (PARI)

%o A030101(n) = if(n<1,0,subst(Polrev(binary(n)),x,2));

%o A057889(n) = if(!n,n,A030101(n/(2^valuation(n,2))) * (2^valuation(n, 2)));

%o A302028(n) = if(!n,n,1+A057889(A057889(n)-1));

%Y Cf. A302027 (inverse).

%Y Cf. A057889.

%Y Cf. also A268718, A302794.

%K nonn,base

%O 0,3

%A _Antti Karttunen_, Apr 26 2018

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 8 06:27 EDT 2020. Contains 336290 sequences. (Running on oeis4.)