# [CoCoA-5 code]
# n := 1; k := 1; p := 1; while True do while k <= n*EulerTotient(k) do p := NextPrime(p); k := k*p; endwhile; println [n, EulerTotient(k)]; incr(ref n); endwhile;
1 1
2 2
3 8
4 48
5 5760
6 36495360
7 1854081073152000
8 400440702414394285778534400000
9 165062110921422523175104166476600499887194872217600000000
10 1651030565452496906032436282048608195577074117480554374969005278877765244397398104473600000000000000000
11 916672451683643400997248253972976302249020128607719330739195672303339174177255822428175288794152464241978108960124803178656994162823711953525283367234148462965555200000000000000000000000000
12 21024262434739513112609318533179295609623822583069063806549541829884539927067246095866285934242057377322954149986614812216267588926275700926769609842586789639100838193482516375946948593800801843304322483197113976738371963805228251110121179670949608776628110283976782761963793271201269526455910400000000000000000000000000000000000000000000
13 226617257879781260320607970544159130974334836746781167831671497450171186916745186072107858244340327051205410345214387034931393587069800086683194557811777836623413153309742059423857034243274626025389221700262537891163533389496546757496002575303908835811312930179215044199399061458910891020881866573939927108765492488298043031815467815766030232163246329065528540879732154039855947789714007862111767282101537592425493785236818890961066900357943086900721361447659049676776825603152266626609521573158003397461971964015390799743448799856558080000000000000000000000000000000000000000000000000000000000000000000000