Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083013
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083013 a(n)=sum(k=0,n-1,9^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, -8, 28, 64, -980, -3104, 81172, 339328, -11878244, -61958240, 2674671076, 16735235392, -855605816468, -6245150369696, 368601472639540, 3074742020313856, -205700802920736452, -1930357641628367072, 144338957346266943364, 1505019970814899568320 (list; graph; listen)
OFFSET

1,3

PROGRAM

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

CROSSREFS

Cf. A001469.

Sequence in context: A101127 A007259 A134747 this_sequence A028553 A100182 A119515

Adjacent sequences: A083010 A083011 A083012 this_sequence A083014 A083015 A083016

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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research