|
Search: id:A051712
|
|
| |
|
| 0, 1, 1, 1, 1, 5, 1, 7, 1, 3, 5, 11, 1, 13, 7, 5, 2, 17, 3, 19, 5, 7, 11, 23, 1, 25, 13, 9, 7, 29, 5, 31, 4, 11, 17, 35, 3, 37, 19, 13, 5, 41, 7, 43, 11, 15, 23, 47, 2, 49, 25, 17, 13, 53, 9, 55, 7, 19, 29, 59, 5, 61, 31, 21, 8, 65, 11, 67, 17, 23, 35, 71, 3, 73
(list; graph; listen)
|
|
|
OFFSET
|
1,6
|
|
|
COMMENT
|
b(n) = a(n+1) is multiplicative with b(2^e) = 1 if p = 2, b(3^e) = p^(e-1), 3, p^e if p >= 5.
|
|
LINKS
|
M. Kaneko, The Akiyama-Tanigawa algorithm for Bernoulli numbers, J. Integer Sequences, 3 (2000), #00.2.9.
|
|
EXAMPLE
|
0, 1/60, 1/60, 1/70, 1/84, 5/504, 1/120, 7/990, 1/165, 3/572,...
|
|
CROSSREFS
|
Cf. A051713. Row 3 of table in A051714/A051715.
Sequence in context: A140215 A068328 A109375 this_sequence A086892 A089027 A023890
Adjacent sequences: A051709 A051710 A051711 this_sequence A051713 A051714 A051715
|
|
KEYWORD
|
nonn,frac,easy,mult
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
