A247383 Smallest number m such that gcd(m,EKG(m)) = n, where EKG = A064413, the EKG sequence.

1, 2, 6, 52, 10, 12, 14, 8, 63, 110, 165, 396, 689, 126, 225, 144, 34, 270, 38, 120, 273, 1430, 828, 2088, 1475, 1014, 432, 476, 58, 4290, 62, 576, 495, 612, 5180, 2448, 4477, 684, 468, 40, 697, 4158, 3139, 6028, 810, 8602, 8601, 4752, 2499, 850, 867, 5148

Offset: 1

Author

Reinhard Zumkeller, Sep 16 2014

Keywords

• nonn

Comments

A247379(a(n)) = n and A247379(m) != n for m < a(n).

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..206

Crossrefs

Cf. A064413, A247379.

Programs

Haskell

import Data.IntMap (empty, member, (!), insert)
a247383 n = a247383_list !! (n-1)
a247383_list = f 1 1 empty where
   f x z m | member x m = m ! x : f (x + 1) (x + 1) m
           | member y m = f x (z + 1) m
           | otherwise  = f x (z + 1) (insert y z m)
           where y = a247379 z