login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024593 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A000201 (lower Wythoff sequence). 0
1, 3, 10, 14, 32, 43, 83, 101, 180, 207, 356, 410, 689, 768, 1272, 1429, 2345, 2584, 4218, 4560, 7419, 8086, 13129, 14127, 22907, 24306, 39381, 42061, 68113, 71940, 116463, 123904, 200546, 211671, 342560, 358160, 579588, 609488, 986250, 1029113 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

CROSSREFS

Sequence in context: A063221 A022409 A023866 * A128930 A048852 A141463

Adjacent sequences:  A024590 A024591 A024592 * A024594 A024595 A024596

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:45 EST 2012. Contains 205694 sequences.