login
This site is supported by donations 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. 2
1, 7, 151, 6847, 532231, 63206287, 10645162711, 2413453999327, 708721089607591, 261679010699505967, 118654880542567722871, 64819182599591545006207, 41987713702382161714004551, 31821948327041297758906340047 (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-1)

MATHEMATICA

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

PROG

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

CROSSREFS

Cf. A100872.

Sequence in context: A070248 A202558 A159659 * A171410 A006761 A144683

Adjacent sequences:  A100865 A100866 A100867 * A100869 A100870 A100871

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 17 03:45 EST 2012. Contains 205978 sequences.