|
%I #24 Mar 06 2020 03:33:32
%S 0,1,0,2,1,0,8,5,0,34,17,16,128,105,96,578,537,536,16,4165,2624,2,
%T 17697,9504,9472,65553,55808,55618,317489,299040,295432,2053,2163968,
%U 1377506,263361,8437888,6328368,5247017,38010912,33623682,1576009,165153832
%N a(n) = Fibonacci(n) AND Fibonacci(n+1).
%H Vincenzo Librandi, <a href="/A051122/b051122.txt">Table of n, a(n) for n = 0..1000</a>
%F A000045(n+2) = a(n) + A051123(n) = A051124(n) + 2*a(n). - _Antti Karttunen_, Dec 03 2012
%e Fibonacci(6) = 8 = 1000_2, Fibonacci(7) = 13 = 1101_2, logical "AND" is 1000_2 = 8, so a(6)=8.
%t Table[BitAnd[Fibonacci[n + 1], Fibonacci[n]], {n, 0, 60}] (* _Vladimir Joseph Stephan Orlovsky_, Feb 21 2012 *)
%t BitAnd@@@Partition[Fibonacci[Range[0,50]],2,1] (* _Harvey P. Dale_, Sep 30 2017 *)
%o (PARI) a(n) = bitand(fibonacci(n), fibonacci(n+1)); \\ _Michel Marcus_, Mar 06 2020
%Y A051122 + A051124 = A051123. Cf. A219660.
%K nonn,easy,base
%O 0,4
%A _N. J. A. Sloane_
%E More terms from Robert Lozyniak (11(AT)onna.com)
|
