id:A124140 - OEIS Search Results

Search: id:A124140

Displaying 1-1 of 1 results found.

page 1

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

+0
2

24, 78, 90, 224, 260, 264, 348, 570, 728, 846, 996, 1580, 2030, 2514, 1692, 4648, 3762, 3552, 4668, 6448, 6954, 6650, 8634, 5250, 4560, 5976, 11994, 13624, 10458, 14056 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`R. Mathar computed this sequence up to 15000.`
	EXAMPLE	`24 is in the sequence because A000203(24)=A000203(38)=60=24+38-GCD(24,38).`
	CROSSREFS	`Cf. A124141.` `Sequence in context: A033572 A048352 A144459 this_sequence A143839 A114818 A068379` `Adjacent sequences: A124137 A124138 A124139 this_sequence A124141 A124142 A124143`
	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 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research