id:A031285 - OEIS Search Results

Search: id:A031285

Displaying 1-1 of 1 results found.

page 1

The odd-greedy Egyptian-fraction algorithm for 5/1444613 has 37 terms, the last of which has 384122451172 digits; sequence gives remainder-numerators.

+0
1

5, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 43, 64, 1 (list; graph; listen)

	OFFSET	`0,1`
	LINKS	`Problem of the week, Web site - problem 848` `Index entries for sequences related to Egyptian fractions`
	CROSSREFS	`Adjacent sequences: A031282 A031283 A031284 this_sequence A031286 A031287 A031288` `Sequence in context: A011226 A019812 A071544 this_sequence A097078 A021195 A019673`
	KEYWORD	`nonn,fini`
	AUTHOR	`David Broadhurst (D.Broadhurst(AT)open.ac.uk)`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research