login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097848 Triangle read by rows: T(n,k) = minimal number of terms needed to write k/n (for 1 <= k <= n with gcd(k,n) = 1) as a sum of unit fractions. 6
1, 1, 1, 2, 1, 2, 1, 2, 2, 3, 1, 2, 1, 2, 3, 2, 3, 3, 1, 2, 2, 3, 1, 2, 2, 2, 3, 3, 1, 2, 2, 3, 1, 2, 2, 2, 3, 2, 3, 4, 4, 4, 1, 2, 2, 3, 1, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 4, 1, 2, 2, 2, 3, 4, 1, 2, 2, 3, 2, 3, 3, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 3, 2, 3, 4, 2, 3, 3, 3, 3, 4, 4, 5, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..99.

Index entries for sequences related to Egyptian fractions

EXAMPLE

Triangle begins:

1

1

1 2

1 2

1 2 2 3

1 2

1 2 3 2 3 3

1 2 2 3

1 2 2 2 3 3

1 2 2 3

1 2 2 2 3 2 3 4 4 4

1 2 2 3

1 2 3 3 3 3 2 3 3 3 3 4

1 2 2 2 3 4

CROSSREFS

Cf. A097847, A097849.

Sequence in context: A109381 A058506 A106698 * A124830 A291598 A287820

Adjacent sequences:  A097845 A097846 A097847 * A097849 A097850 A097851

KEYWORD

nonn,tabf

AUTHOR

Franklin T. Adams-Watters, Aug 31 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified January 20 10:38 EST 2018. Contains 297960 sequences.