This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A011185 A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct. 12
 1, 2, 3, 5, 8, 13, 21, 30, 39, 53, 74, 95, 128, 152, 182, 212, 258, 316, 374, 413, 476, 531, 546, 608, 717, 798, 862, 965, 1060, 1161, 1307, 1386, 1435, 1556, 1722, 1834, 1934, 2058, 2261, 2497, 2699, 2874, 3061, 3197, 3332, 3629, 3712, 3868, 4140, 4447, 4640 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = least positive integer > a(n-1) and not a(i)+a(j)-a(k) for distinct i,j,k < n. LINKS Klaus Brockhaus and Dan Hoey, Table of n, a(n) for n = 1..2839 CROSSREFS a(n) = A010672(n-1)+1. Cf. A033627, A003278, A026471, A075122, A075123, A133097. Sequence in context: A080787 A065124 A048817 * A240733 A283936 A278800 Adjacent sequences:  A011182 A011183 A011184 * A011186 A011187 A011188 KEYWORD nonn AUTHOR STATUS approved

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

Last modified August 20 00:52 EDT 2018. Contains 313902 sequences. (Running on oeis4.)