login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107949 Smallest k_n such that there exist positive integers 0<k_1<...<k_n such that there exists only one tuple of nonnegative integers (l_1,...,l_n) - namely (1,...,1) - such that the sum of the l_i's equals n and the sum of the l_i.k_i's equals the sum of the k_i's. 0
1, 2, 4, 7, 14, 27, 54 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

These are instances that show that the sequence is at most what is given : 1 1+2 1+2+4 1+2+5+7 1+2+6+12+14 1+3+11+22+23+27 1+2+6+22+44+46+54

EXAMPLE

a(3)=4 because 1+2+3=2+2+2 but you can't write 1+2+4 as the sum of three numbers in {1,2,4} in an other way.

a(4)=7 because, for instance, 2+4+5+6=2+5+5+5 but I'll let you check that you can't write 1+2+5+7 as the sum of four numbers in {1,2,5,7}, unless of course you take once each of them.

CROSSREFS

Sequence in context: A018085 A167751 A190822 * A155099 A136322 A160113

Adjacent sequences:  A107946 A107947 A107948 * A107950 A107951 A107952

KEYWORD

hard,nonn

AUTHOR

Vincent Nesme (vnesme(AT)ens-lyon.fr), May 28 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:49 EST 2012. Contains 206058 sequences.