Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156870
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A156870 Number of increasing sequences of length 2n with reciprocals adding up to n (1 <= n). +0
2
1, 4, 18, 168, 3648, 298165 (list; graph; listen)
OFFSET

1,2

COMMENT

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)

Adjacent sequences: A156867 A156868 A156869 this_sequence A156871 A156872 A156873

Sequence in context: A059837 A054759 A007153 this_sequence A145075 A058924 A154731

KEYWORD

more,nonn

AUTHOR

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

EXTENSIONS

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

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 9 12:23 EST 2009. Contains 166233 sequences.


AT&T Labs Research