login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
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
Row sums of A303675.
Sequence in context: A362491 A202558 A159659 * A171410 A277122 A351147
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 4 05:14 EDT 2024. Contains 373986 sequences. (Running on oeis4.)