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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102311 Sum_{k=1..n} Fibonacci(k*(n-k)). 1
0, 1, 2, 7, 22, 86, 414, 2521, 19494, 191695, 2397716, 38148444, 772057396, 19875413009, 650843469738, 27110077916903, 1436411242814058, 96810095832996034, 8299583912379548210, 905077596297808256825, 125547805293905152853710, 22152679283963321048140511 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

G.f.: Sum_{n>=1} Fibonacci(n)*x^(n+1) / (1 - Lucas(n)*x + (-1)^n*x^2), where Lucas(n) = A000204(n). [From Paul D. Hanna, Jan 28 2012]

PROG

(PARI) {a(n)=sum(k=1, n, fibonacci(k*(n-k)))}

(PARI) {Lucas(n)=fibonacci(n-1)+fibonacci(n+1)}

{a(n)=polcoeff(sum(m=1, n, fibonacci(m)*x^(m+1)/(1-Lucas(m)*x+(-1)^m*x^2+x*O(x^n))), n)} /* Paul D. Hanna, Jan 28 2012 */

CROSSREFS

Cf. Antidiagonal sums of array A102310.

Sequence in context: A150323 A150324 A150325 * A150326 A150327 A150328

Adjacent sequences:  A102308 A102309 A102310 * A102312 A102313 A102314

KEYWORD

nonn

AUTHOR

Ralf Stephan, Jan 06 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 20:26 EST 2012. Contains 205852 sequences.