Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A020473
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A020473 Egyptian fractions: number of partitions of 1 into reciprocals of positive integers <= n. +0
6
1, 2, 3, 5, 6, 13, 14, 24, 34, 60, 61, 168, 169, 252, 627, 1011, 1012, 2430, 2431, 7212, 15024, 16553, 16554, 50219, 60008, 64284, 92071, 260178, 260179, 844846, 844847, 1431187, 2608883, 2661217 (list; graph; listen)
OFFSET

1,2

COMMENT

Number of ways to represent 1 = sum_{k=1}^n b(k)/k, where the b(k) >= 0. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Aug 01 2006

LINKS

Toshitaka Suzuki, Table of n, a(n) for n = 1..390

Index entries for sequences related to Egyptian fractions

CROSSREFS

a(n)=Sum(A092666(i),i=1..n). Cf. A038034, A092670.

Adjacent sequences: A020470 A020471 A020472 this_sequence A020474 A020475 A020476

Sequence in context: A075372 A064725 A100330 this_sequence A098833 A075371 A057704

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research