login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A024309 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k=[ (n+1)/2) ], s = (natural numbers >= 2), t = (Fibonacci numbers). 0
2, 2, 7, 12, 27, 43, 85, 138, 253, 409, 718, 1162, 1984, 3210, 5383, 8710, 14433, 23353, 38391, 62118, 101577, 164355, 267804, 433316, 704382, 1139714, 1849751, 2992960, 4852471, 7851463, 12720713, 20582546, 33332005, 53932317, 87313418 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

FORMULA

G.f.:(-2+x^7+2*x^5-3*x^3+x^2)/((x^2+x-1)*(x^4+x^2-1)^2) [From Maksym Voznyy (voznyy(AT)mail.ru), Jul 27 2009]

PROG

(PARI) a(n) = sum(j=1, (n+1)\2, (j+1)*fibonacci(n+1-j)); \\ Michel Marcus, Sep 30 2013

CROSSREFS

Sequence in context: A123209 A123604 A321306 * A047756 A047767 A303588

Adjacent sequences:  A024306 A024307 A024308 * A024310 A024311 A024312

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

More terms from James A. Sellers, May 03 2000

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 August 5 18:22 EDT 2021. Contains 346488 sequences. (Running on oeis4.)