login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182389 a(0)=1, a(n) = (a(n-1) + n) XOR n. 3
1, 3, 7, 9, 9, 11, 23, 25, 41, 59, 79, 81, 81, 83, 111, 113, 145, 179, 215, 249, 281, 315, 327, 329, 377, 395, 447, 449, 449, 451, 511, 513, 513, 515, 519, 521, 521, 523, 535, 537, 617, 699, 719, 721, 721, 723, 815, 881, 913, 1011, 1047, 1145 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) >= n.

a(n) >= a(n-1). - Daniel Leary, Aug 21 2016

LINKS

Ivan Panchenko, Table of n, a(n) for n = 0..1000

FORMULA

a(0)=1, a(n)=(a(n-1) + n) XOR n, where XOR is the bitwise exclusive-OR operator.

EXAMPLE

a(5) = (a(4)+5) XOR 5 = (9+5) XOR 5 = 14 XOR 5 = 11.

PROG

(Python)

a=1

for i in range(1, 55):

. print a,

. a += i

. a ^= i

CROSSREFS

Cf. A182242, A182247.

Sequence in context: A122490 A179021 A096910 * A279615 A169968 A082768

Adjacent sequences:  A182386 A182387 A182388 * A182390 A182391 A182392

KEYWORD

nonn,base

AUTHOR

Alex Ratushnyak, Apr 27 2012

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 09:40 EDT 2018. Contains 316211 sequences. (Running on oeis4.)