id:A092666 - OEIS Search Results

Search: id:A092666

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 0<x_1<=...<=x_k=n.

+0
4

1, 1, 1, 2, 1, 7, 1, 10, 10, 26, 1, 107, 1, 83, 375, 384, 1, 1418, 1, 4781, 7812, 1529, 1, 33665, 9789, 4276, 27787, 168107, 1, 584667, 1, 586340, 1177696, 52334 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`Toshitaka Suzuki, Table of n, a(n) for n = 1..390` `Index entries for sequences related to Egyptian fractions`
	FORMULA	`a(n)=A020473(n)-A020473(n-1)` `a(n)=1 if n is prime.`
	EXAMPLE	`a(4)=2 since there are two fractions 1=1/2+1/4+1/4 and 1=1/4+1/4+1/4+1/4.`
	CROSSREFS	`Cf. A020473, A092667, A092669, A002966, A000058.` `Sequence in context: A155992 A160417 A117044 this_sequence A019426 A128747 A124392` `Adjacent sequences: A092663 A092664 A092665 this_sequence A092667 A092668 A092669`
	KEYWORD	`hard,nonn`
	AUTHOR	`Max Alekseyev (maxale(AT)gmail.com), Mar 02 2004`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research