Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A143823
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A143823 Number of subsets {x(1),x(2),...,x(k)} of {1,2,...,n} such that all differences |x(i)-x(j)| are distinct. +0
2
2, 4, 7, 13, 22, 36, 57, 91, 140, 216, 317, 463, 668, 962, 1359, 1919, 2666, 3694, 5035, 6845 (list; graph; listen)
OFFSET

1,1

COMMENT

See A143824 for sizes of the largest subsets of {1,2,...,n} with the desired property.

EXAMPLE

{1,2,4} is a subset of {1,2,3,4}, with distinct differences 2-1=1, 4-1=3, 4-2=2 between pairs of elements, so {1,2,4} is counted as one of the 13 subsets of {1,2,3,4} with the desired property.

CROSSREFS

A143824

Sequence in context: A061257 A061255 A088111 this_sequence A119983 A085489 A101268

Adjacent sequences: A143820 A143821 A143822 this_sequence A143824 A143825 A143826

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Sep 02 2008

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research