Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A050612
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A050612 Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+3) = FL(n+3)Product(L(2^i)^bit(n,i),i=0..). +0
2
2, 7, 15, 54, 91, 329, 714, 2583, 4183, 15134, 32853, 118863, 200690, 726103, 1576239, 5702886, 9227467, 33385289, 72473466, 262211463, 442721993, 1601783218, 3477183675, 12580568721, 20374242722, 73714702663 (list; graph; listen)
OFFSET

0,1

CROSSREFS

Fourth row of A050609, fourth column of A050610.

Sequence in context: A121165 A093652 A096690 this_sequence A120110 A047694 A129666

Adjacent sequences: A050609 A050610 A050611 this_sequence A050613 A050614 A050615

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research