Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133991
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133991 a(n) = Sum_{k=0..n} binomial(n,k)*binomial(2^k+n-1,n). +0
1
1, 3, 17, 193, 5427, 463023, 134675759, 139917028089, 527871326293913, 7281357469833220843, 368715613115281663650597 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = (1/n!)*Sum_{k=0..n} (-1)^(n-k)*Stirling1(n,k)*(2^k+1)^n. G.f.: Sum_{n>=0} (-ln(1-(2^n+1)*x))^n/n!.

CROSSREFS

Sequence in context: A126443 A054976 A088678 this_sequence A009494 A075271 A072350

Adjacent sequences: A133988 A133989 A133990 this_sequence A133992 A133993 A133994

KEYWORD

easy,more,nonn

AUTHOR

Paul Hanna and Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 21 2008

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research