Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083009
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083009 a(n)=sum(k=0,n-1,5^k*B(k)*C(n,k)) where B(k) is the k-th Bernoulli number and C(n,k)=binomial(n,k). +0
1
0, 1, -4, 6, 16, -74, -264, 1946, 9056, -88434, -512024, 6154786, 42716496, -607884394, -4920817384, 80834386026, 747784582336, -13923204233954, -144898927180344, 3015393801263666, 34867899296006576, -801997872697905114, -10201104981227536904, 256982712667627683706 (list; graph; listen)
OFFSET

1,3

PROGRAM

(PARI) a(n)=sum(k=0, n-1, 5^k*binomial(n, k)*bernfrac(k))

CROSSREFS

Cf. A001469.

Sequence in context: A032295 A072279 A038236 this_sequence A127416 A105271 A024305

Adjacent sequences: A083006 A083007 A083008 this_sequence A083010 A083011 A083012

KEYWORD

sign

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 31 2003

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