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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094521 a(n) = GCD(n, A094457(n)). 3
1, 1, 2, 1, 2, 1, 4, 3, 2, 1, 4, 1, 2, 5, 8, 1, 6, 1, 4, 3, 2, 1, 8, 5, 2, 9, 4, 1, 10, 1, 16, 11, 2, 5, 12, 1, 2, 3, 8, 1, 6, 1, 4, 15, 2, 1, 16, 7, 10, 3, 4, 1, 18, 5, 8, 3, 2, 1, 20, 1, 2, 9, 32, 5, 22, 1, 4, 3, 10, 1, 24, 1, 2, 25, 4, 11, 6, 1, 16, 27, 2, 1, 12, 5, 2, 3, 8, 1, 30, 7, 4, 3, 2, 5, 32, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,3

LINKS

Michael De Vlieger, Table of n, a(n) for n = 2..10000

EXAMPLE

a(18) = gcd(18,12) = 6.

MATHEMATICA

f[n_] := Block[{g, h}, g[x_] := Flatten[Table[#1, {#2}] & @@@ FactorInteger@ x]; h[x_] := If[x == 2, 1, NextPrime[x, -1]]; If[n == 1, 1, Max[Times @@ MapAt[h, g[n], #] & /@ Range[Length@ g[n]]]]]; Table[GCD[i, f@ i], {i, 2, 74}] (* Michael De Vlieger, Jan 31 2015 *)

CROSSREFS

Cf. A094457 A094522.

Sequence in context: A009195 A072994 A052126 * A159272 A098372 A177236

Adjacent sequences:  A094518 A094519 A094520 * A094522 A094523 A094524

KEYWORD

easy,nonn

AUTHOR

Marc LeBrun, May 06 2004

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 14 00:21 EST 2017. Contains 295976 sequences.