login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100872 a(n)=(1/sqrt(5))*sum(k>0,k^(2n)/Phi^(2k)) where Phi=(1+sqrt(5))/2. 2
1, 13, 421, 25453, 2473141, 352444093, 69251478661, 17943523153933, 5927841361456981, 2431910546406522973, 1212989379862721528101, 722875495525684291639213, 507275965883448333971692021 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

A bisection of "Stirling-Bernoulli transform" of Fibonacci numbers

FORMULA

a(n)=A050946(2*n)

MATHEMATICA

FullSimplify[Table[PolyLog[-2k, GoldenRatio^(-2)]/Sqrt[5], {k, 1, 10}]] (* Vladimir Reshetnikov (v.reshetnikov(AT)gmail.com), Feb 16 2011 *)

PROG

(PARI) a(n)=round(1/sqrt(5)*sum(k=1, 500, k^(2*n)/((1+sqrt(5))/2)^(2*k)))

CROSSREFS

Cf. A100868.

Sequence in context: A098890 A012023 A081442 * A012045 A012109 A012084

Adjacent sequences:  A100869 A100870 A100871 * A100873 A100874 A100875

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 08 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:25 EST 2012. Contains 205786 sequences.