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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A020473 Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n. 15
 1, 2, 3, 5, 6, 13, 14, 24, 34, 60, 61, 168, 169, 252, 627, 1011, 1012, 2430, 2431, 7212, 15024, 16553, 16554, 50219, 60008, 64284, 92071, 260178, 260179, 844846, 844847, 1431187, 2608883, 2661217, 7946814, 22692855, 22692856, 22911815 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Number of ways to represent 1 = Sum_{k=1..n} b(k)/k, where the b(k) >= 0. - Franklin T. Adams-Watters, Aug 01 2006 LINKS Toshitaka Suzuki, Table of n, a(n) for n = 1..390 FORMULA a(n) = Sum(A092666(i), i=1..n). For prime p, a(p) = a(p-1) + 1. - Max Alekseyev, May 07 2012 MATHEMATICA Timing[Table[Length[IntegerPartitions[1, All, 1/Range[n]]], {n, 1, 20}]] (* Ben Branman, Apr 21 2012 *) CROSSREFS Cf. A038034, A092670, A208480. Sequence in context: A253644 A100330 A331043 * A098833 A075371 A218948 Adjacent sequences: A020470 A020471 A020472 * A020474 A020475 A020476 KEYWORD nonn 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.

Last modified December 10 02:09 EST 2022. Contains 358712 sequences. (Running on oeis4.)