login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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..). 2

%I #4 May 01 2014 02:49:07

%S 1,3,6,21,35,126,273,987,1598,5781,12549,45402,76657,277347,602070,

%T 2178309,3524579,12752046,27682401,100155867,169104754,611826747,

%U 1328165979,4805349654,7782268225,28156510947,61122728166,221144107989

%N Sum_{i=0..n} (C(n,i) mod 2)*Fibonacci(2i+1) = FL(n+1)Product(L(2^i)^bit(n,i),i=0..).

%Y Second row of A050609, second column of A050610.

%K nonn

%O 0,2

%A _Antti Karttunen_, Oct 24 1999

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)