Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006585 Egyptian fractions: number of solutions to 1 = 1/x_1 +...+ 1/x_n with x_1<...<x_n.
(Formerly M4281)
+0
5
1, 0, 1, 6, 72, 2320, 245765, 151182379 (list; graph; listen)
OFFSET

1,4

COMMENT

All denominators in the expansion 1 = 1/x_1 + ... 1/x_n are bounded by the n-th term of Sylvester's sequence: 0<x_1<...<x_n < A000058(n) - Max Alekseyev (maxale(AT)gmail.com), Dec 30 2003

REFERENCES

Marc LeBrun (mlb(AT)well.com), personal communication.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Index entries for sequences related to Egyptian fractions

EXAMPLE

The 6 solutions for n=4 are 2,3,7,42; 2,3,8,24; 2,3,9,18; 2,3,10,15; 2,4,5,20; 2,4,6,12.

CROSSREFS

Cf. A002966, A002967.

Cf. A000058.

Sequence in context: A009523 A009793 A132878 this_sequence A166472 A008562 A041063

Adjacent sequences: A006582 A006583 A006584 this_sequence A006586 A006587 A006588

KEYWORD

nonn,nice,hard,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Enumeration confirmed by Jud McCranie (j.mccranie(AT)comcast.net)

a(8) from John Dethridge (jcd(AT)ms.unimelb.edu.au), Jan 08 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research