A182936 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A182936

Greatest common divisor of the proper divisors of n, 0 if there are none.

0, 0, 0, 2, 0, 1, 0, 2, 3, 1, 0, 1, 0, 1, 1, 2, 0, 1, 0, 1, 1, 1, 0, 1, 5, 1, 3, 1, 0, 1, 0, 2, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 7, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 3, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

Here a proper divisor d of n is a divisor of n such that 1 < d < n.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

FORMULA

a(n) = 0 if n is not composite, p if n is a proper power of prime p, and 1 otherwise. - Franklin T. Adams-Watters, Mar 22 2011

MAPLE

A182936 := n -> igcd(op(numtheory[divisors](n) minus {1, n}));

seq(A182936(i), i=1..79); # Peter Luschny, Mar 22 2011