Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139218
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139218 Smallest positive integer of the form 3k+2 such that all subsets of {a(1),...,a(n)} have a different sum. +0
4
2, 5, 8, 14, 23, 41, 92, 179, 353, 716, 1427, 2849, 5708, 11411 (list; graph; listen)
OFFSET

1,1

COMMENT

(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) Maximilian Hasler, in a SeqFan memo dated Apr. 9, 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)+2a(n-3), for n>6.

CROSSREFS

Cf. A001045, A139217.

Sequence in context: A000094 A058578 A023674 this_sequence A017988 A103077 A090980

Adjacent sequences: A139215 A139216 A139217 this_sequence A139219 A139220 A139221

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), Apr 11 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research