|
Search: id:A136375
|
|
|
| A136375 |
|
Irregular array read by rows, where n-th row is denominators of Egyptian fraction, derived using the greedy algorithm, of the absolute value of the (2n)th Bernoulli number. |
|
+0
1
|
| |
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
1,6,30,42,30,14,231
|
|
EXAMPLE
|
The 10th Bernoulli number is 5/66. The largest unit fraction <= 5/66 is 1/14. Now 5/66 - 1/14 is 1/231, which is itself a unit fraction. So the Egyptian fraction representation of 5/66 is 1/14 + 1/231. And therefore row 5 of this array is (14,231).
|
|
CROSSREFS
|
Cf. A000367, A002445.
Sequence in context: A062515 A062268 A067879 this_sequence A138706 A002445 A027762
Adjacent sequences: A136372 A136373 A136374 this_sequence A136376 A136377 A136378
|
|
KEYWORD
|
more,nonn,tabl
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Mar 29 2008
|
|
|
Search completed in 0.002 seconds
|
