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

 


a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence).
0

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

%S 3,4,10,14,29,36,65,75,132,152,258,288,480,540,889,980,1604,1734,2826,

%T 3080,5006,5387,8740,9274,15032,16055,26006,27467,44473,47315,76589,

%U 80838,130833,136791,221369,232789,376699,393071,636042,667961,1080825,1128970,1826756

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence).

%K nonn

%O 1,1

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 18:10 EDT 2024. Contains 376182 sequences. (Running on oeis4.)