This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A270429 Minimal total number of unit fractions required to sum up all fractions 1/n, 2/n, ..., n/n. 1
 1, 2, 4, 5, 9, 8, 15, 13, 17, 18, 28, 19, 34, 30, 31, 33, 48, 34, 54, 39, 47, 56, 69, 45, 67, 68, 67, 63, 91, 62, 97, 77, 88, 96, 91, 75, 121, 108, 106, 89, 137, 94, 144, 115, 111, 138, 159, 105, 149, 134, 147, 141, 181, 134, 155, 139, 168, 182, 205, 131 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = Sum_{k=1..n} A097847(n,k). - Alois P. Heinz, Jul 12 2016 EXAMPLE For n = 3: 1/3 and 3/3 = 1/1 are unit fractions themselves. 2/3 can be generated as the sum of two unit fractions: 1/2 + 1/6. This gives us a(3) = 1 + 2 + 1 = 4. CROSSREFS Row sums of A097847. Sequence in context: A116477 A116920 A116919 * A270097 A167511 A242398 Adjacent sequences:  A270426 A270427 A270428 * A270430 A270431 A270432 KEYWORD nonn AUTHOR Carsten Peust, Jul 12 2016 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 16 08:50 EDT 2019. Contains 328056 sequences. (Running on oeis4.)