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!)
A025087 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306. 0

%I #3 Mar 30 2012 18:56:01

%S 1,1,1,1,2,4,7,7,11,11,18,17,28,25,41,33,54,88,142,142,230,229,371,

%T 368,596,588,952,931,1507,1452,2350,2206,3570,3192,5166,4178,6761,

%U 10940,17702,17697,28635,28622,46312,46278,74880,74791,121015,120782,195430,194820,315226

%N s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.

%K nonn

%O 1,5

%A _Clark Kimberling_

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 02:46 EDT 2024. Contains 371917 sequences. (Running on oeis4.)