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

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

%S 3,4,6,8,15,19,29,34,39,43,60,66,84,94,115,125,135,144,172,182,213,

%T 226,259,274,310,326,343,359,400,418,463,483,531,551,603,626,680,704,

%U 729,754,812,839,901,928,995,1023,1093,1124,1196,1228,1303,1337,1372,1405,1486,1521,1605

%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 = A000201 (lower 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 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)