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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092670 a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n. 5
1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 3, 3, 3, 6, 6, 6, 11, 11, 22, 22, 22, 22, 41, 41, 41, 41, 114, 114, 200, 200, 200, 363, 363, 566, 852, 852, 852, 852, 1655, 1655, 3054, 3054, 3054, 5777, 5777, 5777, 10647, 10647, 10647, 10647, 19436, 19436, 33373, 48360, 90441 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Toshitaka Suzuki, Table of n, a(n) for n = 1..610

Index entries for sequences related to Egyptian fractions

FORMULA

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

EXAMPLE

a(6)=2 since there are two fractions 1=1/1 and 1=1/2+1/3+1/6.

CROSSREFS

Cf. A020473, A038034, A092669, A006585.

Sequence in context: A174631 A278949 A030603 * A210528 A120450 A127238

Adjacent sequences:  A092667 A092668 A092669 * A092671 A092672 A092673

KEYWORD

nonn

AUTHOR

Max Alekseyev, Mar 02 2004

EXTENSIONS

More terms from T. Suzuki (suzuki(AT)scio.co.jp), Nov 24 2006

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 20:08 EST 2018. Contains 318188 sequences. (Running on oeis4.)