A345932 - OEIS

A345932

a(n) = A002034(n) / gcd(n, A002034(n)), where A002034(n) gives the smallest positive integer k such that n divides k!.

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3

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

OFFSET

1,9

LINKS

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

Index entries for sequences related to factorial numbers

FORMULA

a(n) = A002034(n) / A345931(n) = A002034(n) / gcd(n, A002034(n))

MATHEMATICA

Table[s=(m=1; While[Mod[m!, n]!=0, m++]; m); s/GCD[n, s], {n, 100}] (* Giorgos Kalogeropoulos, Jul 02 2021 *)

PROG

(PARI)