A092670 a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), 0<x_1<...<x_k<=n.

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

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