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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025087 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306. 0
1, 1, 1, 1, 2, 4, 7, 7, 11, 11, 18, 17, 28, 25, 41, 33, 54, 88, 142, 142, 230, 229, 371, 368, 596, 588, 952, 931, 1507, 1452, 2350, 2206, 3570, 3192, 5166, 4178, 6761, 10940, 17702, 17697, 28635, 28622, 46312, 46278, 74880, 74791, 121015, 120782, 195430, 194820, 315226 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

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

CROSSREFS

Sequence in context: A023978 A152488 A109359 * A291810 A178183 A010759

Adjacent sequences:  A025084 A025085 A025086 * A025088 A025089 A025090

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 21:15 EST 2017. Contains 295919 sequences.