login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024593 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence). 0

%I

%S 1,3,10,14,32,43,83,101,180,207,356,410,689,768,1272,1429,2345,2584,

%T 4218,4560,7419,8086,13129,14127,22907,24306,39381,42061,68113,71940,

%U 116463,123904,200546,211671,342560,358160,579588,609488,986250,1029113

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

%K nonn

%O 1,2

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 24 02:02 EDT 2021. Contains 348217 sequences. (Running on oeis4.)