login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Sum_{i=0..y} (C(y,i) mod 2)*F(2i+x) = FL(y+x)*A050613(y), where A050613(y) = Product_{i=0..floor(log_2(y+1))} L(2^i)^bit(y,i).
5

%I #9 Oct 27 2018 21:57:15

%S 0,1,1,1,3,3,2,4,6,12,3,7,9,21,21,5,11,15,33,35,77,8,18,24,54,56,126,

%T 168,13,29,39,87,91,203,273,609,21,47,63,141,147,329,441,987,987,34,

%U 76,102,228,238,532,714,1596,1598,3572,55,123,165,369,385,861,1155,2583

%N Sum_{i=0..y} (C(y,i) mod 2)*F(2i+x) = FL(y+x)*A050613(y), where A050613(y) = Product_{i=0..floor(log_2(y+1))} L(2^i)^bit(y,i).

%C Rows cut from column 2 onward form a subset of Wythoff array (A035513), where the terms of column 0 (A051656) give the positions of those rows in that array.

%p a(n) = generic_bincoeff_fibsum_as_sum( (n-((trinv(n)*(trinv(n)-1))/2)),(((trinv(n)-1)*(((1/2)*trinv(n))+1))-n) );

%Y Transpose of A050609. First row: A000045, second row: A000032, third row: A022086.

%K nonn,tabl

%O 0,5

%A _Antti Karttunen_, Oct 24 1999