login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A031285
The odd-greedy Egyptian-fraction algorithm for 5/1444613 has 37 terms, the last of which has 384122451172 digits; sequence gives remainder-numerators.
0
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
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
0,1
LINKS
Table of n, a(n) for n=0..36.
Problem of the week,
Web site
- problem 848
Index entries for sequences related to Egyptian fractions
CROSSREFS
Sequence in context:
A019812
A222222
A071544
*
A307603
A234593
A262429
Adjacent sequences:
A031282
A031283
A031284
*
A031286
A031287
A031288
KEYWORD
nonn
,
fini
,
full
AUTHOR
David Broadhurst
STATUS
approved
Lookup
|
Welcome
|
Wiki
|
Register
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Style Sheet
|
Transforms
|
Superseeker
|
Recents
The OEIS Community
| Maintained by
The OEIS Foundation Inc.
License Agreements, Terms of Use, Privacy Policy.
.
Last modified April 25 13:34 EDT 2024. Contains 371971 sequences. (Running on oeis4.)