cp's OEIS Frontend

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.

A050610 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).

Original entry on oeis.org

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, 168, 13, 29, 39, 87, 91, 203, 273, 609, 21, 47, 63, 141, 147, 329, 441, 987, 987, 34, 76, 102, 228, 238, 532, 714, 1596, 1598, 3572, 55, 123, 165, 369, 385, 861, 1155, 2583
Offset: 0

Views

Author

Antti Karttunen, Oct 24 1999

Keywords

Comments

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.

Crossrefs

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

Programs

  • Maple
    a(n) = generic_bincoeff_fibsum_as_sum( (n-((trinv(n)*(trinv(n)-1))/2)),(((trinv(n)-1)*(((1/2)*trinv(n))+1))-n) );