Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129814
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129814 a(n) = Bernoulli(n)*(n+1)!. +0
1
1, -1, 1, 0, -4, 0, 120, 0, -12096, 0, 3024000, 0, -1576143360, 0, 1525620096000, 0, -2522591034163200, 0, 6686974460694528000, 0, -27033456071346536448000, 0, 160078872315904478576640000, 0, -1342964491649083924630732800000, 0 (list; graph; listen)
OFFSET

0,5

COMMENT

Contribution from Peter Luschny (peter(AT)luschny), Apr 21 2009: (Start)

Reading A137777 and A159749 as a triangular sequence:

2*a(n) = A137777(n, 0) for n > 0.

2*a(n) = (-1)^n*A159749(n, 0) for n >= 0. (End)

PROGRAM

(PARI) {for(n=0, 25, print1(bernfrac(n)*(n+1)!, ", "))}

CROSSREFS

Cf. A001332 (Bernoulli(2n)*(2n+1)!).

Sequence in context: A101502 A118440 A013037 this_sequence A129825 A138734 A119010

Adjacent sequences: A129811 A129812 A129813 this_sequence A129815 A129816 A129817

KEYWORD

sign

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), May 20 2007

EXTENSIONS

Edited and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 28 2007

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


AT&T Labs Research