A319990 - OEIS

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

A319990

a(n) = Product_{d|n, d<n} A019565(d)^[0 == d mod 3].

1, 1, 1, 1, 1, 6, 1, 1, 6, 1, 1, 90, 1, 1, 6, 1, 1, 1260, 1, 1, 6, 1, 1, 3150, 1, 1, 84, 1, 1, 18900, 1, 1, 6, 1, 1, 1455300, 1, 1, 6, 1, 1, 9900, 1, 1, 17640, 1, 1, 242550, 1, 1, 6, 1, 1, 19209960, 1, 1, 6, 1, 1, 764032500, 1, 1, 9240, 1, 1, 2340, 1, 1, 6, 1, 1, 7283776500, 1, 1, 1260, 1, 1, 35100, 1, 1, 38808, 1, 1, 94594500, 1, 1, 6, 1, 1

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

OFFSET

1,6

LINKS

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

FORMULA

a(n) = Product_{d|n, d<n} A019565(d)^[0 == d mod 3].

a(n) = A293214(n) / (A319991(n)*A319992(n)).

For all n >= 1:

A007814(a(n)) = A320003(n).

A195017(a(n)) = 0 mod 3.

PROG