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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051122 a(n) = Fibonacci(n) AND Fibonacci(n+1). 4
0, 1, 0, 2, 1, 0, 8, 5, 0, 34, 17, 16, 128, 105, 96, 578, 537, 536, 16, 4165, 2624, 2, 17697, 9504, 9472, 65553, 55808, 55618, 317489, 299040, 295432, 2053, 2163968, 1377506, 263361, 8437888, 6328368, 5247017, 38010912, 33623682, 1576009, 165153832 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

A000045(n+2) = A051122(n) + A051123(n) = A051124(n) + 2*A051122(n). - Antti Karttunen, Dec 03 2012

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

EXAMPLE

Fib(6)=8=1000, Fib(7)=13=1101, logical "AND" is 1000 = 8, so a(6)=8.

MATHEMATICA

Table[BitAnd[Fibonacci[n + 1], Fibonacci[n]], {n, 0, 60}] (* Vladimir Joseph Stephan Orlovsky, Feb 21 2012 *)

BitAnd@@@Partition[Fibonacci[Range[0, 50]], 2, 1] (* Harvey P. Dale, Sep 30 2017 *)

CROSSREFS

A051122+A051124 = A051123. Cf. A219660.

Sequence in context: A195284 A076341 A110510 * A266042 A202817 A322222

Adjacent sequences:  A051119 A051120 A051121 * A051123 A051124 A051125

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 January 21 11:21 EST 2019. Contains 319354 sequences. (Running on oeis4.)