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!)
A051123 a(n) = Fibonacci(n) OR Fibonacci(n+1). 3
1, 1, 3, 3, 7, 13, 13, 29, 55, 55, 127, 217, 249, 505, 891, 1019, 2047, 3645, 6749, 6781, 15087, 28655, 28671, 65521, 111921, 130865, 262003, 458611, 514551, 1047229, 1882877, 3522525, 3538919, 7849959, 14666991, 15719929, 32759801 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

EXAMPLE

Fibonacci(6) = 8 = 1000_2, Fibonacci(7) = 13 = 1101_2, logical "OR" is 1101_2 = 13, so a(6)=13.

PROG

(PARI)  a(n) = bitor(fibonacci(n), fibonacci(n+1)); \\ Michel Marcus, Mar 06 2020

CROSSREFS

A051122 + A051124 = A051123.

Sequence in context: A088859 A177942 A116880 * A096188 A187873 A306665

Adjacent sequences:  A051120 A051121 A051122 * A051124 A051125 A051126

KEYWORD

nonn,easy,base

AUTHOR

N. J. A. Sloane

EXTENSIONS

More terms from Robert Lozyniak (11(AT)onna.com)

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 June 13 21:58 EDT 2021. Contains 345010 sequences. (Running on oeis4.)