Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025082
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025082 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 = (F(2), F(3), F(4), ...). +0
1
2, 3, 8, 13, 31, 50, 105, 170, 340, 550, 1058, 1712, 3212, 5197, 9564, 15475, 28065, 45410, 81395, 131700, 233832, 378348, 666468, 1078368, 1886966, 3053175, 5312240, 8595385 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Adjacent sequences: A025079 A025080 A025081 this_sequence A025083 A025084 A025085

Sequence in context: A045692 A103196 A113954 this_sequence A129873 A025575 A077055

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research