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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100868 a(n) = Sum_{k>0} k^(2n-1)/phi^(2k) where phi = (1+sqrt(5))/2 = A001622. 4
 1, 7, 151, 6847, 532231, 63206287, 10645162711, 2413453999327, 708721089607591, 261679010699505967, 118654880542567722871, 64819182599591545006207, 41987713702382161714004551, 31821948327041297758906340047, 27896532358791207565357448388631 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS A bisection of "Stirling-Bernoulli transform" of Fibonacci numbers. LINKS Alois P. Heinz, Table of n, a(n) for n = 1..224 FORMULA a(n) = A050946(2*n-1). MATHEMATICA FullSimplify[Table[PolyLog[1 - 2k, GoldenRatio^(-2)], {k, 1, 10}]] (* Vladimir Reshetnikov, Feb 16 2011 *) PROG (PARI) a(n)=round(sum(k=1, 500, k^(2*n-1)/((1+sqrt(5))/2)^(2*k))) CROSSREFS Cf. A001622, A050946, A100872. Row sums of A303675. Sequence in context: A232446 A202558 A159659 * A171410 A277122 A305686 Adjacent sequences:  A100865 A100866 A100867 * A100869 A100870 A100871 KEYWORD nonn AUTHOR Benoit Cloitre, Jan 08 2005 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 December 4 17:03 EST 2021. Contains 349526 sequences. (Running on oeis4.)