id:A093799 - OEIS Search Results

Search: id:A093799

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; a(n+1) is the smallest triangular number such that thre greatest common divisor GCD(a(n+1), a(n)) is a triangular number itself.

+0
1

1, 3, 6, 15, 21, 36, 55, 78, 105, 120, 153, 190, 210, 231, 276, 325, 378, 435, 465, 528, 595, 666, 741, 820, 903, 990, 1035, 1128, 1225, 1326, 1431, 1540, 1596, 1711, 1830, 1953, 2080, 2211, 2346, 2485, 2628, 2775, 2926, 3081, 3240, 3403, 3570, 3741, 3916 (list; graph; listen)

	OFFSET	`1,2`
	CROSSREFS	`Sequence in context: A069559 A117748 A061066 this_sequence A087359 A129602 A044888` `Adjacent sequences: A093796 A093797 A093798 this_sequence A093800 A093801 A093802`
	KEYWORD	`easy,nonn`
	AUTHOR	`Jason Earls (zevi_35711(AT)yahoo.com), May 18 2004`
	EXTENSIONS	`Better description from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 07 2006`

page 1

Search completed in 0.002 seconds

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.

AT&T Labs Research