id:A011185 - OEIS Search Results

Search: id:A011185

Displaying 1-1 of 1 results found.

page 1

A B_2 sequence: a(n) = least value such that sequence increases and pairwise sums of distinct elements are all distinct.

+0
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; listen)

	OFFSET	`1,2`
	COMMENT	`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` `Index entries for B_2 sequences.`
	CROSSREFS	`a(n) = A010672(n)+1.` `Cf. A033627, A003278, A026471, A075122, A075123, A133097.` `Sequence in context: A080787 A065124 A048817 this_sequence A055806 A023438 A117760` `Adjacent sequences: A011182 A011183 A011184 this_sequence A011186 A011187 A011188`
	KEYWORD	`nonn`
	AUTHOR	`Dan Hoey (Hoey(AT)AIC.NRL.Navy.Mil)`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research