Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025123
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025123 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A001950 (upper Wythoff sequence), t = A023533. +0
1
0, 0, 2, 5, 7, 0, 0, 0, 2, 5, 7, 10, 13, 15, 18, 20, 23, 0, 2, 5, 7, 10, 13, 15, 18, 20, 23, 26, 28, 31, 34, 36, 39, 43, 49, 54, 59, 13, 15, 18, 20, 23, 26, 28, 31, 34, 36, 39, 41, 44, 47, 49, 52, 54, 59, 65, 69, 75, 81, 85, 91, 95, 101, 107, 111, 117, 123, 36, 39, 41, 44, 47, 49, 52, 54, 57, 60, 62 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Sequence in context: A055877 A111190 A009376 this_sequence A071791 A021393 A010589

Adjacent sequences: A025120 A025121 A025122 this_sequence A025124 A025125 A025126

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research