Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039799
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A039799 For S a subset of [ n ]={1,2,3,...n}, let B_S={x+y:x,y in S, x<y}; then a(n) is maximal cardinality of B_S intersect B_{[ n ]-S}. +0
1
1, 1, 2, 3, 6, 6, 9, 10, 12, 14, 17 (list; graph; listen)
OFFSET

5,3

EXAMPLE

a(7)=3 since we can divide [ 7 ] into S={1,5,6} and T={2,3,4,7} giving B_S={6,7,11} and B_T={5,6,7,9,10,11}, with intersection {6,7,11} of cardinality 3.

CROSSREFS

Sequence in context: A023832 A080235 A056907 this_sequence A144583 A155215 A119319

Adjacent sequences: A039796 A039797 A039798 this_sequence A039800 A039801 A039802

KEYWORD

hard,nonn

AUTHOR

Erich Friedman (erich.friedman(AT)stetson.edu)

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 December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research