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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247383 Smallest number m such that GCD(m,EKG(m)) = n, where EKG = A064413, the EKG sequence. 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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

PROG

(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

CROSSREFS

Cf. A064413, A247379.

Sequence in context: A134047 A078464 A108905 * A298994 A203634 A027263

Adjacent sequences:  A247380 A247381 A247382 * A247384 A247385 A247386

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Sep 16 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 04:44 EDT 2019. Contains 324217 sequences. (Running on oeis4.)