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!)
A162407 a(n) = A162406(n+1) - A162406(n). 2

%I

%S 1,2,1,4,5,2,1,4,9,5,5,4,5,14,1,16,17,9,9,5,21,5,5,4,9,5,5,14,14,30,1,

%T 16,16,17,35,9,9,9,9,40,9,21,21,44,5,14,5,16,49,9,9,5,21,5,5,14,14,14,

%U 14,30,30,30,63,64,16,16,16,17,17,35,35,9,9,9,9,9,9,14,9,80,40,9,9,21

%N a(n) = A162406(n+1) - A162406(n).

%C a(j) can only equal some A162406(k). [_Robert G. Wilson v_, Aug 01 2009]

%t a[0] = 1; a[n_] := a[n] = a[n - 1] + Max@ Select[ Table[a@i, {i, 0, n - 1}], StringPosition[ ToString@ FromDigits@ IntegerDigits[n, 2], ToString@ FromDigits@ IntegerDigits[ #, 2]] != {} &]; t = Table[ a@n, {n, 0, 100}]; Rest@t - Most@t (* _Robert G. Wilson v_, Aug 01 2009 *)

%Y Cf. A162405, A162406.

%K base,nonn

%O 0,2

%A _Leroy Quet_, Jul 02 2009

%E More terms beginning with a(11) from _Robert G. Wilson v_, Aug 01 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 February 5 12:29 EST 2023. Contains 360084 sequences. (Running on oeis4.)