|
Search: id:A047699
|
|
|
| A047699 |
|
A sparse maximal expulsion set under addition. |
|
+0
3
|
|
| 1, 4, 10, 17, 29, 44, 67, 91, 117, 148, 180, 215, 251, 288, 329, 371, 420, 471, 523, 576, 631, 687, 746, 806, 870, 935, 1004, 1074, 1146, 1221, 1297, 1376, 1456, 1538, 1623, 1709, 1802, 1896, 1993, 2092, 2194, 2300, 2409, 2519, 2631, 2753, 2876, 3001, 3127
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
K. S. Brown, Expulsion Sets
|
|
FORMULA
|
To get a(n+1): all a(i)+-a(j), i, j<=n, are excluded; a(n+1)=a(n)+smallest unexcluded element.
|
|
EXAMPLE
|
After {1,4,10}, 1+1, 4-1, 1+4, 10-4 etc. are excluded, 7 is not, so next term is 10+7=17.
|
|
CROSSREFS
|
Cf. A047705, A047706.
Sequence in context: A138105 A002442 A008022 this_sequence A096077 A008147 A108726
Adjacent sequences: A047696 A047697 A047698 this_sequence A047700 A047701 A047702
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
K. S. Brown (ksbrown(AT)seanet.com)
|
|
|
Search completed in 0.002 seconds
|
