A030324 Triangle read by rows, where row k consists of the binary digits of Fibonacci(k+1).
1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0
Offset: 1
Examples
Triangle starts 1 1, 0 1, 1 1, 0, 1 1, 0, 0, 0 1, 1, 0, 1 1, 0, 1, 0, 1 1, 0, 0, 0, 1, 0
Links
- Robert Israel, Table of n, a(n) for n = 1..10098 (rows 1 to 170, flattened)
Programs
-
Maple
for n from 2 to 30 do ListTools:-Reverse(convert(combinat:-fibonacci(n),base,2)) od; # Robert Israel, Sep 12 2018
-
Mathematica
Flatten[Map[IntegerDigits[#, 2] &, Table[Fibonacci[n], {n, 50}], {1}]] (* Ben Branman, Feb 14 2011 *) IntegerDigits[#,2]&/@Fibonacci[Range[2,20]]//Flatten (* Harvey P. Dale, May 29 2021 *)
Extensions
Edited by Robert Israel, Sep 12 2018