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

 

Logo
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

%I #6 Mar 30 2012 17:26:51

%S 1,1,1,4,1,44,1,235,921,4038,1,66147,1,304383,6581754,45353329,1,

%T 1100311690,1,44423279911,1250831952086,284120133400,1,71664788693247,

%U 511162204140999,55479698795314,10715917223431762,505603414069366830,1,28696102343693431631,1,857699266471525509621,30399386408588668316839,63063040603038091480

%N a(n) = number of Egyptian fractions 1 = 1/x_1 + ... + 1/x_k (for any k), with max{x_i}=n.

%H <a href="/index/Ed#Egypt">Index entries for sequences related to Egyptian fractions</a>

%F a(n)=A038034(n)-A038034(n-1)

%F a(n)=1 if n is prime.

%e 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.

%Y Cf. A092666, A038034, A092669, A002967, A000058.

%K nonn

%O 1,4

%A _Max Alekseyev_, Mar 02 2004

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:27 EDT 2024. Contains 371971 sequences. (Running on oeis4.)