login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269170 a(n) = n OR floor(n/2), where OR is bitwise-OR (A003986). 1
0, 1, 3, 3, 6, 7, 7, 7, 12, 13, 15, 15, 14, 15, 15, 15, 24, 25, 27, 27, 30, 31, 31, 31, 28, 29, 31, 31, 30, 31, 31, 31, 48, 49, 51, 51, 54, 55, 55, 55, 60, 61, 63, 63, 62, 63, 63, 63, 56, 57, 59, 59, 62, 63, 63, 63, 60, 61, 63, 63, 62, 63, 63, 63, 96, 97, 99, 99, 102, 103, 103, 103, 108, 109, 111, 111, 110, 111 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Fibbinary numbers (A003714) give all integers n >= 0 for which a(n) = A003188(n) and also for which a(n) = A032766(n).

LINKS

Antti Karttunen, Table of n, a(n) for n = 0..8191

FORMULA

a(n) = A003986(n,(n-A000035(n))/2).

Other identities and observations. For all n >= 0:

a(2n) = A163617(n).

A003188(n) <= a(n) <= A032766(n).

PROG

(Scheme)

(define (A269170 n) (A003986bi n (/ (- n (A000035 n)) 2))) ;; Here A003986bi implements dyadic bitwise-OR operation (see A003986).

(PARI) a(n) = bitor(n, n\2); \\ Michel Marcus, Feb 29 2016

CROSSREFS

Cf. A000035, A003714, A003986.

Cf. A163617 (even bisection).

Cf. also A003188, A048735, A032766.

Sequence in context: A008867 A185958 A273062 * A003879 A333885 A270060

Adjacent sequences:  A269167 A269168 A269169 * A269171 A269172 A269173

KEYWORD

nonn,base

AUTHOR

Antti Karttunen, Feb 22 2016

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 26 01:33 EDT 2021. Contains 346294 sequences. (Running on oeis4.)