Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050611
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050611 Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+1) = FL(n+1)Product(L(2^i)^bit(n,i),i=0..). +0
3
1, 3, 6, 21, 35, 126, 273, 987, 1598, 5781, 12549, 45402, 76657, 277347, 602070, 2178309, 3524579, 12752046, 27682401, 100155867, 169104754, 611826747, 1328165979, 4805349654, 7782268225, 28156510947, 61122728166, 221144107989 (list; graph; listen)
OFFSET

0,2
CROSSREFS

Second row of A050609, second column of A050610.

Sequence in context: A101719 A101582 A069558 this_sequence A056499 A056489 A015649

Adjacent sequences: A050608 A050609 A050610 this_sequence A050612 A050613 A050614

KEYWORD

nonn

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 December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.