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!)
A024373 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = A000201 (lower Wythoff sequence). 0

%I #4 Mar 30 2012 18:55:54

%S 1,3,4,6,12,15,25,29,34,39,52,60,77,84,106,115,125,135,160,172,199,

%T 213,245,259,295,310,326,343,383,400,443,463,510,531,580,603,656,680,

%U 704,729,787,812,874,901,965,995,1061,1093,1164,1196,1270,1303,1337,1372,1450,1486

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)