login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A228811 GCD's arising in A228810. 1
11, 43, 11, 11, 121, 11, 11, 1153, 109, 97, 11, 11, 11, 11, 11, 19, 2909, 6221, 297889, 3, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..21.

Wikipedia, Greatest common divisor

PROG

(PARI) isA000430(n)=isprime(n) || (issquare(n, &n) && isprime(n))

t=0; for(n=2, 1e6, t+=1/(n-1); if(!isA000430(n) && gcd(n, numerator(t))>1, print1(gcd(n, numerator(t))", "))) \\ Charles R Greathouse IV, Sep 04 2013

CROSSREFS

Cf. A001008, A228810.

Sequence in context: A027978 A050489 A156533 * A096638 A089712 A155711

Adjacent sequences:  A228808 A228809 A228810 * A228812 A228813 A228814

KEYWORD

nonn

AUTHOR

Arkadiusz Wesolowski, Sep 04 2013

EXTENSIONS

a(14)-a(15) from Charles R Greathouse IV, Sep 04 2013

a(16)-a(21) from Charles R Greathouse IV, Sep 09 2013

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 August 7 06:02 EDT 2020. Contains 336274 sequences. (Running on oeis4.)