login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A281530 Triangle read by rows: T(n,k) = number of terms for the shortest Egyptian fraction representation of k/n, 1 <= k < n. 3
1, 1, 2, 1, 1, 2, 1, 2, 2, 3, 1, 1, 1, 2, 2, 1, 2, 3, 2, 3, 3, 1, 1, 2, 1, 2, 2, 3, 1, 2, 1, 2, 2, 2, 3, 3, 1, 1, 2, 2, 1, 2, 2, 3, 3, 1, 2, 2, 2, 3, 2, 3, 4, 4, 4, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 3, 1, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 4, 1, 1, 2, 2, 2, 3, 1, 2, 2, 3, 3, 3, 4, 1, 2, 1, 2, 1, 2, 3, 2, 2, 2, 3, 3, 3, 3 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
2,3
COMMENTS
Not same as A050205. Example: the fraction 9/20 requires three terms in its greedy expansion, but 9/20 = 1/4 + 1/5, so T(20,9) = 2.
LINKS
EXAMPLE
The triangle T(n,k) begins:
2: 1
3: 1 2
4: 1 1 2
5: 1 2 2 3
6: 1 1 1 2 2
7: 1 2 3 2 3 3
8: 1 1 2 1 2 2 3
9: 1 2 1 2 2 2 3 3
CROSSREFS
Cf. A281527.
Sequence in context: A029319 A243987 A050205 * A340260 A175190 A317685
KEYWORD
nonn,tabl
AUTHOR
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 June 21 11:00 EDT 2024. Contains 373544 sequences. (Running on oeis4.)