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!)
A162437 a(1)=1, a(2)=2. Take terms a(n-1) and a(n-2), then convert to binary. Concatenate them, with either binary a(n-1) on the left and a(n-2) on the right, or with a(n-1) on the right and a(n-2) on the left such that the value of the resulting binary number is minimized. a(n) = the decimal equivalent of the resulting binary number. 1

%I #9 Aug 01 2015 21:34:22

%S 1,2,5,21,173,5549,1420717,11638517165,24407739551034797,

%T 419321772563920711635545517,

%U 15107659029337673520218077770654501397966253

%N a(1)=1, a(2)=2. Take terms a(n-1) and a(n-2), then convert to binary. Concatenate them, with either binary a(n-1) on the left and a(n-2) on the right, or with a(n-1) on the right and a(n-2) on the left such that the value of the resulting binary number is minimized. a(n) = the decimal equivalent of the resulting binary number.

%e The binary representation of the first few terms: 1, 10, 101, 10101, 10101101

%t a[1] = 1; a[2] = 2; a[n_] := Block[{a1 = IntegerDigits[ a[n - 1], 2], a2 = IntegerDigits[ a[n - 2], 2]}, Min[ FromDigits[ Join[a1, a2], 2], FromDigits[ Join[a2, a1], 2]]]; Array[a, 13] (* _Robert G. Wilson v_, Jul 27 2009 *)

%Y Cf. A005203, A111061, A162438.

%K base,nonn

%O 1,2

%A _Leroy Quet_, Jul 03 2009

%E More terms from _Robert G. Wilson v_, Jul 27 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 23 15:20 EDT 2024. Contains 371916 sequences. (Running on oeis4.)