id:A124141 - OEIS Search Results

Search: id:A124141

Displaying 1-1 of 1 results found.

page 1

Numbers n such that there is a number m < n satisfying A000203(n) = A000203(m) = m + n - GCD(m,n), where GCD denotes the greatest common divisor.

+0
2

38, 92, 153, 284, 332, 459, 494, 885, 956, 1035, 1358, 1784, 2295, 2528, 2678, 5434, 5607, 6027, 6255, 7564, 7928, 8235, 8648, 9729, 10325, 10413, 12008, 14104, 15813, 16198 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`38 is in the sequence because A000203(24)=A000203(38)=60=24+38-GCD(24,38).`
	CROSSREFS	`Cf. A124140.` `Sequence in context: A044557 A014716 A137028 this_sequence A093649 A020167 A044225` `Adjacent sequences: A124138 A124139 A124140 this_sequence A124142 A124143 A124144`
	KEYWORD	`nonn`
	AUTHOR	`Yasutoshi Kohmoto zbi74583(AT)boat.zero.ad.jp, Dec 01 2006`
	EXTENSIONS	`Edited by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 14 2007`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research