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!)
A159848 a(n+1) = a(n) + greatest previous term whose binary representation is contained in that of a(n); with a(1)=1, a(2)=2. 2

%I #6 Jan 28 2014 00:52:18

%S 1,2,3,4,6,9,13,19,28,34,38,57,85,87,90,103,122,135,139,173,186,199,

%T 205,243,300,309,347,520,524,530,539,552,586,595,614,652,658,667,705,

%U 711,910,1109,1194,1279,1298,1332,1370,1543,1549,1562,1575,1609,1618,1627

%N a(n+1) = a(n) + greatest previous term whose binary representation is contained in that of a(n); with a(1)=1, a(2)=2.

%C A159849(n) = a(n+1) - a(n).

%H R. Zumkeller, <a href="/A159848/b159848.txt">Table of n, a(n) for n = 1..10000</a>

%e a(3)=a(2)+a(1)=3='11', '1' in '10';

%e a(4)=a(3)+a(1)=4='100', '1' in '11';

%e a(5)=a(4)+a(2)=6='110', '10' in '100';

%e a(6)=a(5)+a(3)=9='1001', '11' in '110';

%e a(7)=a(6)+a(4)=13='1101', '100' in '1001';

%e a(8)=a(7)+a(5)=19='10011', '110' in '1101';

%e a(9)=a(8)+a(6)=28='11100', '1001' in '10011';

%e a(10)=a(9)+a(5)=34='100010', '110' in '11100';

%e a(11)=a(10)+a(4)=38='100110', '100' in '100010';

%e a(12)=a(11)+a(8)=57='111001', '10011' in '100110'.

%Y Cf. A007088, A159849.

%K nonn,base,look

%O 1,2

%A _Reinhard Zumkeller_, Apr 24 2009

%E Edited by _N. J. A. Sloane_, Jul 18 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 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)