id:A092670 - OEIS Search Results

Search: id:A092670

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

+0
4

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 (list; graph; listen)

	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: A090618 A072748 A030603 this_sequence A120450 A127238 A072114` `Adjacent sequences: A092667 A092668 A092669 this_sequence A092671 A092672 A092673`
	KEYWORD	`nonn`
	AUTHOR	`Max Alekseyev (maxale(AT)gmail.com), Mar 02 2004`
	EXTENSIONS	`More terms from T. Suzuki (suzuki(AT)scio.co.jp), Nov 24 2006`

page 1

Search completed in 0.002 seconds

Last modified December 17 13:29 EST 2009. Contains 170826 sequences.

AT&T Labs Research