Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050610
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050610 Sum_{i=0..y} (C(y,i) mod 2)*F(2i+x) = FL(y+x)*A050613[y], where A050613[y] = Product(L(2^i)^bit(y,i),i=0..[log2(y+1)]). +0
6
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 (list; table; graph; listen)
OFFSET

0,5

COMMENT

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.

MAPLE

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

CROSSREFS

Transpose of A050609. First row: A000045, Second Row: A000032, Third row: A022086.

Adjacent sequences: A050607 A050608 A050609 this_sequence A050611 A050612 A050613

Sequence in context: A106686 A106702 A057435 this_sequence A117937 A110897 A116644

KEYWORD

nonn,tabl

AUTHOR

Antti Karttunen Oct 24 1999

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.


AT&T Labs Research