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!)
A097847 Triangle read by rows: T(n,k) = minimal number of terms needed to write k/n (for 1 <= k <= n) as a sum of unit fractions. 8

%I #13 Jan 11 2020 15:23:25

%S 1,1,1,1,2,1,1,1,2,1,1,2,2,3,1,1,1,1,2,2,1,1,2,3,2,3,3,1,1,1,2,1,2,2,

%T 3,1,1,2,1,2,2,2,3,3,1,1,1,2,2,1,2,2,3,3,1,1,2,2,2,3,2,3,4,4,4,1,1,1,

%U 1,1,2,1,2,2,2,2,3,1,1,2,3,3,3,3,2,3,3,3,3,4,1,1,1,2,2,2,3,1,2

%N Triangle read by rows: T(n,k) = minimal number of terms needed to write k/n (for 1 <= k <= n) as a sum of unit fractions.

%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>

%F T(n, n-1) = A330808(n). - _Jon E. Schoenfield_, Jan 11 2020

%e Triangle begins:

%e 1

%e 1 1

%e 1 2 1

%e 1 1 2 1

%e 1 2 2 3 1

%e 1 1 1 2 2 1

%e 1 2 3 2 3 3 1

%e 1 1 2 1 2 2 3 1

%e 1 2 1 2 2 2 3 3 1

%e 1 1 2 2 1 2 2 3 3 1

%e 1 2 2 2 3 2 3 4 4 4 1

%Y Cf. A097848, A097849, A330808.

%Y Row sums give A270429.

%K nonn,tabl

%O 1,5

%A _Franklin T. Adams-Watters_, Aug 31 2004

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 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)