This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182505 a(0)=0, a(1)=1, a(n) = ( (a(n-1)+a(n-2)) AND n) + n. 0
 0, 1, 2, 6, 4, 5, 6, 10, 8, 9, 10, 14, 20, 13, 14, 26, 16, 17, 18, 22, 20, 21, 22, 26, 40, 25, 26, 46, 36, 45, 46, 58, 64, 65, 34, 70, 68, 37, 70, 74, 40, 73, 74, 46, 84, 45, 46, 58, 80, 49, 50, 86, 52, 53, 86, 58, 72, 57, 58, 110, 100, 77, 110, 122, 128, 129 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n)>=n. LINKS FORMULA a(0)=0, a(1)=1, a(n) = ( (a(n-1)+a(n-2)) AND n) + n, where AND is the bitwise AND operator. PROG (Python) prpr = 0 prev = 1 for n in range(2, 99):   current = n + ((prpr + prev) & n)   print prpr,   prpr = prev   prev = current CROSSREFS Sequence in context: A222236 A175386 A021382 * A010465 A065630 A110633 Adjacent sequences:  A182502 A182503 A182504 * A182506 A182507 A182508 KEYWORD nonn,base,easy AUTHOR Alex Ratushnyak, May 02 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .