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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175299 a(n) = the smallest positive integer such that A175298(a(n)) = the n-th positive integer that is a palindrome when written in binary. 0

%I

%S 1,2,4,6,8,10,16,20,18,22,32,36,34,38,64,72,68,76,66,74,70,78,128,136,

%T 132,140,130,138,134,142,256,272,264,280,260,276,268,284,258,274,266,

%U 282,262,278,270,286,512,528,520,536,516,532,524,540,514,530,522

%N a(n) = the smallest positive integer such that A175298(a(n)) = the n-th positive integer that is a palindrome when written in binary.

%F a(n) = 2^floor(log_2(P(n))) + P(n)(mod 2^(floor(log_2(P(n))/2)+1)) -1, where P(n) = the n-th positive integer that is a palindrome when written in binary.

%Y Cf. A175298

%K base,nonn

%O 1,2

%A _Leroy Quet_, Mar 24 2010

%E More terms from _Nathaniel Johnston_, Nov 18 2010

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.

Last modified April 1 21:44 EDT 2023. Contains 361697 sequences. (Running on oeis4.)