login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
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. 16
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 equal to a(i)+a(j)-a(k) for distinct i and j with 1 <= i,j,k <= n-1. [Comment corrected by Jean-Paul Delahaye, Oct 02 2020.]

LINKS

Klaus Brockhaus and Dan Hoey, Table of n, a(n) for n = 1..2839

Index entries for B_2 sequences.

FORMULA

a(n) = A010672(n-1)+1.

CROSSREFS

Cf. A010672.

Cf. A033627, A003278, A026471, A066720, A075122, A075123, A133097.

Cf. A036241, A349777.

Sequence in context: A080787 A065124 A048817 * A240733 A283936 A278800

Adjacent sequences:  A011182 A011183 A011184 * A011186 A011187 A011188

KEYWORD

nonn

AUTHOR

Dan Hoey

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 26 03:33 EST 2022. Contains 358353 sequences. (Running on oeis4.)