|
Search: id:A106394
|
|
|
| A106394 |
|
Table read by rows, where n-th row is denominators of Egyptian fraction, derived using the greedy algorithm, of the n-th harmonic number (sum{k=1 to n}1/k). |
|
+0
4
|
|
| 1, 1, 2, 1, 2, 3, 1, 1, 12, 1, 1, 4, 30, 1, 1, 3, 9, 180, 1, 1, 2, 11, 514, 395780, 1, 1, 2, 5, 56, 1, 1, 2, 4, 13, 489, 5339880, 1, 1, 2, 3, 11, 212, 113013, 18448242120, 1, 1, 1, 51, 3711, 30680205, 1192281609186360, 1, 1, 1, 10, 312, 180180
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Let s be the sum of the harmonic numbers. When s > 1, the Egyprian fraction here begins with floor(s) 1's. - Jud McCranie (j.mccranie(AT)comcast.net), May 03 2005
The n-th row of the table has A112330(n) terms.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
By the greedy algorithm, sum{k=1 to 4} 1/k = 1 + 1 + 1/12.
|
|
CROSSREFS
|
Cf. A106395.
Sequence in context: A103823 A136642 A080382 this_sequence A091412 A106036 A007001
Adjacent sequences: A106391 A106392 A106393 this_sequence A106395 A106396 A106397
|
|
KEYWORD
|
easy,nonn,tabf
|
|
AUTHOR
|
Leroy Quet May 01 2005
|
|
EXTENSIONS
|
More terms from Jud McCranie (j.mccranie(AT)comcast.net), May 03 2005
|
|
|
Search completed in 0.002 seconds
|
