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!)
A165819 a(n) = the smallest positive integer that, when written in binary, contains both binary n and binary 2n-1 as substrings. 5

%I #12 Mar 03 2018 09:47:51

%S 1,6,11,28,37,22,29,120,137,83,43,92,205,59,61,496,529,291,595,167,

%T 169,86,183,376,793,410,437,220,925,123,125,2016,2081,1091,2211,583,

%U 293,1227,2471,2536,2601,339,171,2796,729,366,751,1520,3121,1586,1637,1652

%N a(n) = the smallest positive integer that, when written in binary, contains both binary n and binary 2n-1 as substrings.

%C If a(n) in binary was instead to contain binary n and binary 2n+1 as substrings, then a(n) would = 2n+1 for all n.

%H Rémy Sigrist, <a href="/A165819/b165819.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A294977(n, 2*n-1). - _Rémy Sigrist_, Mar 03 2018

%Y Cf. A165820, A165821, A165822, A294977.

%K base,nonn

%O 1,2

%A _Leroy Quet_, Sep 28 2009

%E More terms from _Carl R. White_, Oct 06 2009

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 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)