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

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

%S 5,7,10,13,25,31,48,56,64,71,98,108,138,153,188,204,220,235,280,297,

%T 347,368,422,446,505,531,558,584,651,680,753,785,863,896,980,1017,

%U 1105,1144,1184,1224,1319,1362,1463,1507,1615,1661,1774,1824,1941,1993,2115,2170,2226

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)