Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025084
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025084 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A000201 (lower Wythoff sequence). +0
1
3, 4, 10, 14, 29, 36, 65, 75, 132, 152, 258, 288, 480, 540, 889, 980, 1604, 1734, 2826, 3080, 5006, 5387, 8740, 9274, 15032, 16055, 26006, 27467, 44473, 47315, 76589, 80838, 130833, 136791, 221369, 232789, 376699, 393071, 636042, 667961, 1080825, 1128970, 1826756 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A167273 A096380 A071019 this_sequence A134512 A106523 A121720

Adjacent sequences: A025081 A025082 A025083 this_sequence A025085 A025086 A025087

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research