Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100868
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100868 a(n)=sum(k>0,k^(2n-1)/Phi^(2k)) where Phi=(1+sqrt(5))/2. +0
3
1, 7, 151, 6847, 532231, 63206287, 10645162711, 2413453999327, 708721089607591, 261679010699505967, 118654880542567722871, 64819182599591545006207, 41987713702382161714004551, 31821948327041297758906340047 (list; graph; listen)
OFFSET

1,2

COMMENT

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

FORMULA

a(n)=A050946(2*n-1)

PROGRAM

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

CROSSREFS

Cf. A100872.

Sequence in context: A152552 A070248 A159659 this_sequence A006761 A144683 A141835

Adjacent sequences: A100865 A100866 A100867 this_sequence A100869 A100870 A100871

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research