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!)
A024374 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 = A001950 (upper Wythoff sequence). 0

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

%S 2,5,7,10,20,25,41,48,56,64,86,98,126,138,173,188,204,220,261,280,325,

%T 347,399,422,480,505,531,558,623,651,721,753,829,863,943,980,1066,

%U 1105,1144,1184,1278,1319,1419,1463,1567,1615,1723,1774,1889,1941,2061,2115,2170

%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 = A001950 (upper Wythoff sequence).

%K nonn

%O 1,1

%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 09:28 EDT 2024. Contains 371967 sequences. (Running on oeis4.)