The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092667 a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), with max{x_i}=n. 4
 1, 1, 1, 4, 1, 44, 1, 235, 921, 4038, 1, 66147, 1, 304383, 6581754, 45353329, 1, 1100311690, 1, 44423279911, 1250831952086, 284120133400, 1, 71664788693247, 511162204140999, 55479698795314, 10715917223431762, 505603414069366830, 1, 28696102343693431631, 1, 857699266471525509621, 30399386408588668316839, 63063040603038091480 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS FORMULA a(n)=A038034(n)-A038034(n-1) a(n)=1 if n is prime. EXAMPLE a(4)=4 since there are four fractions 1=1/2+1/4+1/4, 1=1/4+1/2+1/4, 1=1/4+1/4+1/2 and 1=1/4+1/4+1/4+1/4. CROSSREFS Cf. A092666, A038034, A092669, A002967, A000058. Sequence in context: A193962 A302441 A269906 * A060627 A113101 A316159 Adjacent sequences:  A092664 A092665 A092666 * A092668 A092669 A092670 KEYWORD nonn AUTHOR Max Alekseyev, Mar 02 2004 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 May 25 17:36 EDT 2020. Contains 334595 sequences. (Running on oeis4.)