login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156870 Number of increasing sequences of length 2n with reciprocals adding up to n (1 <= n). 1
1, 4, 18, 168, 3648, 298165 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Conjecture: A156869(2n + m, n + m) = a(n) if and only if m >= 0.

EXAMPLE

For n = 2, the a(2) = 4 sequences are (1, 2, 3, 6), (1, 2, 4, 4), (1, 3, 3, 3) and (2, 2, 2, 2) because 1/1 + 1/2 + 1/3 + 1/6 = 1/1 + 1/2 + 1/4 + 1/4 = 1/1 + 1/3 + 1/3 + 1/3 = 1/2 + 1/2 + 1/2 + 1/2 = 2.

CROSSREFS

a(n) = A156869(2n, n)

Sequence in context: A059837 A054759 A007153 * A145075 A058924 A154731

Adjacent sequences:  A156867 A156868 A156869 * A156871 A156872 A156873

KEYWORD

more,nonn

AUTHOR

Jens Voss (jens(AT)voss-ahrensburg.de), Feb 17 2009

EXTENSIONS

a(6) from M. F. Hasler, Feb 21 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 05:55 EST 2012. Contains 205860 sequences.