Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A005261
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A005261 Sum C(n,k)^5, k = 0 . . n.
(Formerly M2156)
+0
2
1, 2, 34, 488, 9826, 206252, 4734304, 113245568, 2816649826, 72001228052, 1883210876284, 50168588906768, 1357245464138656, 37198352117916992, 1030920212982957184, 28847760730478655488, 814066783370083977826 (list; graph; listen)
OFFSET

0,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

C. Elsner, On recurrence formulae for sums involving binomial coefficients, Fib. Q., 43 (No. 1, 2005), 31-45.

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

FORMULA

a(n) ~ 4*5^(-1/2)*pi^-2*n^-2*2^(5*n) - Joe Keane (jgk(AT)jgk.org), Jun 21 2002

CROSSREFS

Sequence in context: A136362 A098531 A092408 this_sequence A104898 A071799 A098704

Adjacent sequences: A005258 A005259 A005260 this_sequence A005262 A005263 A005264

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Matthew Conroy (list1(AT)madandmoonly.com), Mar 16 2006

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research