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

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A020473 Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n. 12
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

Index entries for sequences related to Egyptian fractions

FORMULA

a(n) = Sum(A092666(i), i=1..n).

For prime p, a(p) = a(p-1) + 1. [From 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: A075372 A064725 A100330 * A098833 A075371 A218948

Adjacent sequences:  A020470 A020471 A020472 * A020474 A020475 A020476

KEYWORD

nonn

AUTHOR

David W. Wilson

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 27 17:39 EST 2014. Contains 250249 sequences.