|
Search: id:A066062
|
|
|
| A066062 |
|
Number of distinct subsets S of T={0,1,2,...,n} such that each element of T is the sum of two elements of S. |
|
+0
6
|
|
| 1, 1, 2, 3, 6, 10, 20, 37, 73, 139, 275, 533, 1059, 2075, 4126, 8134, 16194, 32058, 63910, 126932, 253252, 503933, 1006056, 2004838, 4004124, 7987149, 15957964
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
This sequence may be equivalent to A008929, but has a somewhat different definition. The size of the smallest subset counted by this sequence, for a given n, is given in A066063.
Contribution from S. R. Finch (Steven.Finch(AT)inria.fr), Mar 15 2009: (Start)
Such sets S are called additive 2-bases for {0,1,2,...,n}.
a(n) is also the number of symmetric numerical sets S with atom monoid A(S) equal to {0,2n+2,2n+3,2n+4,2n+5,...}. (End)
|
|
LINKS
|
S. R. Finch, Monoids of natural numbers
J. Marzuola and A. Miller, Counting numerical sets with no small atoms. [From S. R. Finch (Steven.Finch(AT)inria.fr), Mar 15 2009]
|
|
EXAMPLE
|
For n=2, the definition obviously requires that S contain both 0 and 1. The only subsets of {0,1,2} that do this are {0,1} and {0,1,2}. For both of these, we have 0=0+0, 1=0+1, 2=1+1, so a(2)=2.
|
|
CROSSREFS
|
A008929, A066063
Cf. A158291 [From S. R. Finch (Steven.Finch(AT)inria.fr), Mar 15 2009]
Sequence in context: A002215 A007562 A008929 this_sequence A164047 A158291 A045690
Adjacent sequences: A066059 A066060 A066061 this_sequence A066063 A066064 A066065
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
John W. Layman (layman(AT)math.vt.edu), Dec 01 2001
|
|
|
Search completed in 0.002 seconds
|
