Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076575
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076575 a(0)=1 if n>0 a(n)=(-1)^(n+1)/(2n+1)*sum(k=0,n,4^(7k)*B(2k)*C(2n+1,2k)) where B(k) denotes the k-th Bernoulli number. +0
1
1, 2731, 8942387, 104670662071, 2400942582854087, 89402734746017557411, 4893960739529013452828987, 369582933150490997215583309551, 36809796323680462279091281973219087 (list; graph; listen)
OFFSET

0,2

PROGRAM

(PARI) a(n)=sum(i=0, n, 4^(7*i)*bernfrac(2*i)*binomial(2*n+1, 2*i))

CROSSREFS

Sequence in context: A031812 A116461 A104699 this_sequence A015423 A045155 A122473

Adjacent sequences: A076572 A076573 A076574 this_sequence A076576 A076577 A076578

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Oct 19 2002

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research