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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066262 a(n) = GCD(n, A066260(n)). 2
1, 2, 3, 4, 1, 6, 1, 8, 9, 2, 1, 12, 1, 2, 3, 16, 1, 18, 1, 4, 3, 2, 1, 24, 1, 2, 27, 4, 1, 6, 1, 32, 3, 2, 1, 36, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 48, 1, 2, 3, 4, 1, 54, 5, 8, 3, 2, 1, 12, 1, 2, 9, 64, 1, 6, 1, 4, 3, 2, 1, 72, 1, 2, 3, 4, 1, 6, 1, 16, 81, 2, 1, 12, 1, 2, 3, 8, 1, 18, 1, 4, 3, 2, 5, 96 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROG

(PARI) Composite(n) = { local(k); k=n + primepi(n) + 1; while (k != n + primepi(k) + 1, k = n + primepi(k) + 1); return(k) } { for (n=1, 1000, f=factor(n); a=1; for (i=1, matsize(f)[1], a*=Composite(primepi(f[i, 1]))^f[i, 2]); a=gcd(n, a); write("b066262.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Feb 07 2010]

CROSSREFS

Different from A065331.

Sequence in context: A050144 A124406 A065331 * A174715 A069817 A071439

Adjacent sequences:  A066259 A066260 A066261 * A066263 A066264 A066265

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 10 2001

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 14 19:37 EST 2012. Contains 205663 sequences.