login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A139218
Smallest positive integer of the form 3k+2 such that all subsets of {a(1),...,a(n)} have a different sum.
3
2, 5, 8, 14, 23, 41, 92, 179, 353, 716, 1427, 2849, 5708, 11411
OFFSET
1,1
COMMENTS
(1) It appears that {a(n+1)-2a(n)} is eventually periodic, with values {1,-2,-2,-5,-5,10,-5,-5,10,-5,-5,10,-5,...}.
(2) See A139217 for the corresponding sequence using integers of the form 3k+1.
(3) M. F. Hasler, in a SeqFan memo dated Apr 09 2008, notes that the Jacobsthal sequence (A001045) from a(2) on (i.e., 1,3,5,11,21,...) gives the smallest positive odd integer such that all subsets of {a(2),...,a(n)} have a different sum.
FORMULA
It appears that a(n) = a(n-1)+a(n-2)+2*a(n-3), for n>6.
CROSSREFS
Sequence in context: A281864 A304025 A264395 * A263235 A017988 A282444
KEYWORD
nonn
AUTHOR
John W. Layman, Apr 11 2008
STATUS
approved