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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A118726 a(n)=sum(k=0,n,F(n+k)*binomial(n+k,k)) where F=A000045. 0
 0, 3, 25, 224, 2073, 19646, 189267, 1845115, 18148809, 179759988, 1790426165, 17914292003, 179925732000, 1812940879359, 18317715471523, 185522533906512, 1882911883226921, 19145400126464070, 194989385131146079 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS If (2n+1)>5 is not divisible by 5 and (2n+1) divides a(n) then (2n+1) is often prime. What is the set of exceptions? LINKS PROG (PARI) a(n)=sum(k=0, n, binomial(n+k, k)*fibonacci(n+k)) CROSSREFS Sequence in context: A155640 A024217 A199679 * A066221 A332468 A134272 Adjacent sequences:  A118723 A118724 A118725 * A118727 A118728 A118729 KEYWORD nonn AUTHOR Benoit Cloitre, May 21 2006 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.

Last modified July 28 19:33 EDT 2021. Contains 346335 sequences. (Running on oeis4.)