id:A092667 - OEIS Search Results

Search: id:A092667

Displaying 1-1 of 1 results found.

page 1

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

+0
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; listen)

	OFFSET	`1,4`
	LINKS	`Index entries for sequences related to Egyptian fractions`
	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: A061036 A144267 A011801 this_sequence A060627 A113101 A113112` `Adjacent sequences: A092664 A092665 A092666 this_sequence A092668 A092669 A092670`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxale(AT)gmail.com), Mar 02 2004`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research