|
%I #33 Mar 15 2023 11:48:59
%S 1,13,421,25453,2473141,352444093,69251478661,17943523153933,
%T 5927841361456981,2431910546406522973,1212989379862721528101,
%U 722875495525684291639213,507275965883448333971692021,414031618935013558427928710653,388884101194230308462039862028741
%N a(n) = (1/sqrt(5)) * Sum_{k>0} k^(2n)/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="/A100872/b100872.txt">Table of n, a(n) for n = 1..223</a>
%F a(n) = A050946(2*n).
%F From _Peter Bala_, Aug 20 2014: (Start)
%F E.g.f.: -1/2 + (1/2)*exp(z)/(3*exp(z) - exp(2*z) - 1) = z^2/2! + 13*z^4/4! + 421*z^6/6! + ....
%F a(n) = Sum_{k = 1..n} 2^(k-1)*A241171(n,k).
%F a(n) = Sum_{1 <= j <= k <= n} (-1)^(k-j)*binomial(2*k,k+j)*j^(2*n).
%F (End)
%t FullSimplify[Table[PolyLog[-2k, GoldenRatio^(-2)]/Sqrt[5], {k, 1, 10}]] (* _Vladimir Reshetnikov_, Feb 16 2011 *)
%t T[n_, k_] /; 1 <= k <= n := T[n, k] = k(2k-1) T[n-1, k-1] + k^2 T[n-1, k]; T[_, 1] = 1; T[_, _] = 0; a[n_] := Sum[2^(k-1) T[n, k], {k, 1, n}]; Array[a, 15] (* _Jean-François Alcover_, Jul 03 2019 *)
%o (PARI) a(n)=round(1/sqrt(5)*sum(k=1,500,k^(2*n)/((1+sqrt(5))/2)^(2*k)))
%Y Cf. A001622, A050946, A100868, A241171.
%K nonn,easy
%O 1,2
%A _Benoit Cloitre_, Jan 08 2005
|
