id:A097293 - OEIS Search Results

Search: id:A097293

Displaying 1-1 of 1 results found.

page 1

Contains exactly once every triple i,j,k such that 0<i<j<k.

+0
2

1, 2, 3, 1, 2, 4, 1, 2, 5, 1, 3, 4, 1, 2, 6, 1, 3, 5, 2, 3, 4, 1, 2, 7, 1, 3, 6, 1, 4, 5, 2, 3, 5, 1, 2, 8, 1, 3, 7, 1, 4, 6, 2, 3, 6, 2, 4, 5, 1, 2, 9, 1, 3, 8, 1, 4, 7, 1, 5, 6, 2, 3, 7, 2, 4, 6, 3, 4, 5, 1, 2, 10, 1, 3, 9, 1, 4, 8, 1, 5, 7, 2, 3, 8, 2, 4, 7, 2, 5, 6, 3, 4, 6, 1, 2, 11, 1, 3, 10, 1, 4, 9, 1, 5 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`Terms are lexically ordered in triples by sum: 1 2 3 (sum = 6) 1 2 4 (sum = 7) 1 2 5, then 1 3 4 (two triples having sum = 8), etc.`
	CROSSREFS	`Cf. A098294.` `Sequence in context: A109206 A088422 A100833 this_sequence A026793 A072193 A097966` `Adjacent sequences: A097290 A097291 A097292 this_sequence A097294 A097295 A097296`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Aug 05 2004`

page 1

Search completed in 0.002 seconds

Last modified December 7 08:40 EST 2009. Contains 170430 sequences.

AT&T Labs Research