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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A182538 a(n)=(a(n-1) AND a(n-2)) + n. 1
0, 1, 2, 3, 6, 7, 12, 11, 16, 9, 10, 19, 14, 15, 28, 27, 40, 25, 26, 43, 30, 31, 52, 43, 56, 65, 26, 27, 54, 47, 68, 35, 32, 65, 34, 35, 70, 39, 44, 75, 48, 41, 74, 51, 46, 79, 60, 59, 104, 89, 122, 139, 62, 63, 116, 107, 152, 65, 58, 59, 118, 111, 164, 99, 96, 161, 98, 99, 166, 103 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

Table of n, a(n) for n=0..69.

FORMULA

a(0)=0, a(1)=1, a(n)=(a(n-1) AND a(n-2)) + n, where AND is the bitwise AND operator.

PROG

(Python)

prpr, prev = 0, 1

for n in range(2, 99):

.  current = (prpr & prev) + n

.  print prpr,

.  prpr, prev = prev, current

CROSSREFS

Cf. A182536.

Sequence in context: A023773 A115889 A101319 * A030013 A130404 A064689

Adjacent sequences:  A182535 A182536 A182537 * A182539 A182540 A182541

KEYWORD

nonn,base,easy

AUTHOR

Alex Ratushnyak, May 04 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 18 13:43 EDT 2018. Contains 316321 sequences. (Running on oeis4.)