|
%I #17 May 12 2018 16:54:13
%S 1,7,151,6847,532231,63206287,10645162711,2413453999327,
%T 708721089607591,261679010699505967,118654880542567722871,
%U 64819182599591545006207,41987713702382161714004551,31821948327041297758906340047,27896532358791207565357448388631
%N a(n) = Sum_{k>0} k^(2n-1)/phi^(2k) where phi = (1+sqrt(5))/2 = A001622.
%C A bisection of "Stirling-Bernoulli transform" of Fibonacci numbers.
%H Alois P. Heinz, <a href="/A100868/b100868.txt">Table of n, a(n) for n = 1..224</a>
%F a(n) = A050946(2*n-1).
%t FullSimplify[Table[PolyLog[1 - 2k, GoldenRatio^(-2)], {k, 1, 10}]] (* _Vladimir Reshetnikov_, Feb 16 2011 *)
%o (PARI) a(n)=round(sum(k=1,500,k^(2*n-1)/((1+sqrt(5))/2)^(2*k)))
%Y Cf. A001622, A050946, A100872.
%Y Row sums of A303675.
%K nonn
%O 1,2
%A _Benoit Cloitre_, Jan 08 2005
|
