login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A331167 a(n) = min(n, A193231(n)), where A193231(n) is blue code of n. 3

%I #13 Dec 10 2020 01:34:24

%S 0,1,2,2,4,4,6,7,8,9,10,11,10,11,9,8,16,16,18,19,20,21,22,22,24,25,26,

%T 27,27,26,24,25,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,34,35,

%U 33,32,39,38,36,37,45,44,46,47,40,41,43,42,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,68,69,71,70,65,64,66,67,75,74,72,73,78,79,77,76

%N a(n) = min(n, A193231(n)), where A193231(n) is blue code of n.

%C For all i, j > 0: a(i) = a(j) => A280501(i) = A280501(j).

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

%H Antti Karttunen, <a href="/A331167/a331167.txt">Data supplement: n, a(n) computed for n = 0..65537</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%H <a href="/index/Ge#GF2X">Index entries for sequences related to polynomials in ring GF(2)[X]</a>

%F a(n) = min(n, A193231(n)).

%o (PARI) A331167(n) = { my(x='x); min(n,subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2)); };

%Y Cf. A193231, A280501.

%Y Cf. also A331166.

%K nonn

%O 0,3

%A _Antti Karttunen_, Jan 12 2020

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 12:37 EDT 2024. Contains 371937 sequences. (Running on oeis4.)