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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247379 a(n) = GCD(EKG(n),n) with EKG = A064413. 4
1, 2, 1, 2, 1, 3, 1, 8, 1, 5, 1, 6, 1, 7, 3, 8, 1, 2, 1, 1, 3, 1, 1, 1, 5, 2, 1, 1, 1, 6, 1, 2, 1, 17, 7, 2, 1, 19, 3, 40, 1, 2, 1, 1, 3, 2, 1, 6, 7, 1, 3, 4, 1, 1, 5, 2, 1, 29, 1, 2, 1, 31, 9, 64, 1, 2, 1, 1, 3, 2, 1, 8, 1, 1, 3, 1, 7, 1, 1, 2, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) = GCD(A064413(n),n);

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

LINKS

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

PROG

(Haskell)

a247379 n = gcd n $ a064413 n

CROSSREFS

Cf. A064413, A152458 (fixed points), A247383.

Sequence in context: A046206 A137753 A134780 * A154819 A104145 A230981

Adjacent sequences:  A247376 A247377 A247378 * A247380 A247381 A247382

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Sep 15 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 May 19 06:41 EDT 2019. Contains 323386 sequences. (Running on oeis4.)