Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A139217
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A139217 Smallest positive integer of the form 3k+1 such that all subsets of {a(1),...,a(n)} have a different sum. +0
3
1, 4, 7, 13, 22, 49, 97, 190, 385, 769, 1534, 3073, 6145, 12286 (list; graph; listen)
OFFSET

1,2

COMMENT

(1) It appears that {a(n+1)-2a(n)} is eventually periodic, with values {2,-1,-1,-4,5,-1,-4,5,-1,-4,5,-1,-4,...}.

(2) See A139218 for the corresponding sequence using integers of the form 3k+2.

(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>4.

CROSSREFS

Cf. A001045, A139218.

Adjacent sequences: A139214 A139215 A139216 this_sequence A139218 A139219 A139220

Sequence in context: A068940 A008471 A111314 this_sequence A038391 A090854 A039694

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 October 6 16:13 EDT 2008. Contains 144667 sequences.


AT&T Labs Research