login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025071 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (F(2), F(3), F(4), ...). 0

%I

%S 2,3,5,8,18,29,55,89,144,233,398,644,1076,1741,2872,4647,7519,12166,

%T 19829,32084,52146,84374,136897,221504,359011,580892,939903,1520795,

%U 2462295,3984077,6448956,10434630,16887767,27324981,44219513,71548675,115779134,187334574,303113708

%N s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (F(2), F(3), F(4), ...).

%K nonn

%O 1,1

%A _Clark Kimberling_

%E More terms from _Sean A. Irvine_, Aug 05 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 10:47 EDT 2019. Contains 328147 sequences. (Running on oeis4.)