|
Search: id:A051716
|
|
|
| A051716 |
|
Numerators of Bernoulli twin numbers C(n). |
|
+0
9
|
|
| 1, -1, -1, -1, -1, 1, 1, -1, -1, 1, 5, -5, -691, 691, 7, -7, -3617, 3617, 43867, -43867, -174611, 174611, 854513, -854513, -236364091, 236364091, 8553103, -8553103, -23749461029, 23749461029, 8615841276005, -8615841276005, -7709321041217, 7709321041217, 2577687858367
(list; graph; listen)
|
|
|
OFFSET
|
0,11
|
|
|
COMMENT
|
The Bernoulli twin numbers C(n) are defined by C(0) = 1, then C(2n) = B(2n)+B(2n-1), C(2n+1) = -B(2n+1)-B(2n), where B() are the Bernoulli numbers A027641/A027642. The definition is due to Paul Curtz.
Negatives of numerators of column 1 of table described in A051714/A051715.
|
|
LINKS
|
M. Kaneko, The Akiyama-Tanigawa algorithm for Bernoulli numbers, J. Integer Sequences, 3 (2000), #00.2.9.
|
|
EXAMPLE
|
Sequence of C(n)'s begins: 1, -1/2, -1/3, -1/6, -1/30, 1/30, 1/42, -1/42, -1/30, 1/30, 5/66, -5/66, -691/2730, 691/2730, 7/6, -7/6, ...
|
|
MAPLE
|
C:=proc(n) if n=0 then RETURN(1); fi; if n mod 2 = 0 then RETURN(bernoulli(n)+bernoulli(n-1)); else RETURN(-bernoulli(n)-bernoulli(n-1)); fi; end;
|
|
CROSSREFS
|
Cf. A051717, A129825, A129826, A129724, A051714, A051715.
Sequence in context: A048607 A094463 A055928 this_sequence A102060 A102058 A078473
Adjacent sequences: A051713 A051714 A051715 this_sequence A051717 A051718 A051719
|
|
KEYWORD
|
sign,easy,nice,frac
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 08 1999
Edited by N. J. A. Sloane (njas(AT)research.att.com), May 25 2008
|
|
|
Search completed in 0.002 seconds
|
