This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A037093 #9 Jul 08 2025 21:04:01 %S A037093 0,1,3,14,57,229,916,7761,29567,117474,469113,3973641,15138352, %T A037093 60146777,240187355,2070207870,7733090689,30791909229,260408711716, %U A037093 991495872825,3942106110215,15739612088946,133333733918417 %N A037093 "Sloping binary representation" of Fibonacci numbers, slope = +1. %F A037093 a(n) := Sum(bit_n(A000045(n+i), i)*(2^i), i=0..inf) [ bit_n := (x, n) -> `mod`(floor(x/(2^n)), 2); ] %F A037093 In practice, n can be used as an upper limit instead of infinity. %e A037093 When Fibonacci numbers are written in binary (see A004685), under each other as: %e A037093 0000000 (0) %e A037093 0000001 (1) %e A037093 0000001 (1) %e A037093 0000010 (2) %e A037093 0000011 (3) %e A037093 0000101 (5) %e A037093 0001000 (8) %e A037093 0001101 (13) %e A037093 0010101 (21) %e A037093 0100010 (34) %e A037093 0110111 (55) %e A037093 1011001 (89) %e A037093 and one starts collecting their bits from column-0 to SW-direction (from the least to the most significant end), one gets 000... (0), ...00001 (1), ...00011 (3), ...001110 (14), etc. (See A102370 for similar transformation done on nonnegative integers). %Y A037093 Same sequence in octal: A037098. Cf. also: A102370, A000045, A037094-A037095, A036284. %K A037093 nonn,base %O A037093 0,3 %A A037093 _Antti Karttunen_, Jan 28 1999 %E A037093 Entry revised Dec 29 2007