Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100872
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100872 a(n)=(1/sqrt(5))*sum(k>0,k^(2n)/Phi^(2k)) where Phi=(1+sqrt(5))/2. +0
3
1, 13, 421, 25453, 2473141, 352444093, 69251478661, 17943523153933, 5927841361456981, 2431910546406522973, 1212989379862721528101, 722875495525684291639213, 507275965883448333971692021 (list; graph; listen)
OFFSET

1,2

COMMENT

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

FORMULA

a(n)=A050946(2*n)

PROGRAM

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

CROSSREFS

Cf. A100868.

Adjacent sequences: A100869 A100870 A100871 this_sequence A100873 A100874 A100875

Sequence in context: A098890 A012023 A081442 this_sequence A012045 A012109 A012084

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research