[go: up one dir, main page]

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

%I #8 Jul 27 2019 12:06:38

%S 0,0,7,10,13,15,18,20,38,44,48,54,60,64,70,75,106,114,121,130,137,145,

%T 153,160,169,177,223,233,244,255,265,275,286,297,307,317,328,339,403,

%U 416,430,442,456,469,481,496,508,521,534,547,561,574,659,675,690,707,722,737,755

%N a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023531, t = A001950 (upper Wythoff sequence).

%Y Cf. A001950, A023531.

%K nonn

%O 2,3

%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 August 29 19:56 EDT 2024. Contains 375518 sequences. (Running on oeis4.)