login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124140 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. 1
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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: A048352 A144459 A206010 * A206003 A143839 A114818

Adjacent sequences:  A124137 A124138 A124139 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 06:27 EST 2012. Contains 205998 sequences.