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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
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; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..28.

CROSSREFS

Sequence in context: A103196 A113954 A191393 * A317911 A151889 A294151

Adjacent sequences:  A025079 A025080 A025081 * A025083 A025084 A025085

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 23 04:00 EDT 2019. Contains 325230 sequences. (Running on oeis4.)