cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A062763 a(n) is the greatest common divisor of (n-1)! and n^n.

This page as a plain text file.
%I A062763 #14 Jun 29 2018 02:12:32
%S A062763 1,1,1,2,1,24,1,16,9,640,1,20736,1,7168,6075,2048,1,23887872,1,
%T A062763 8192000,321489,2883584,1,10319560704,625,54525952,59049,2877292544,1,
%U A062763 835884417024000000,1,67108864,578739249,36507222016,187578125,61628086298345472,1
%N A062763 a(n) is the greatest common divisor of (n-1)! and n^n.
%C A062763 a(n) = 1 iff n is 1 or a prime.
%H A062763 Harry J. Smith, <a href="/A062763/b062763.txt">Table of n, a(n) for n = 1..300</a>
%F A062763 a(n) = A051696(n)/n.
%e A062763 a(10) = gcd(9!, 10^10) = gcd(2^7*3^4*5*7, 2^10*5^10) = 2^7*5 = 640.
%o A062763 (PARI) a(n)=gcd((n-1)!, n^n); \\ _Harry J. Smith_, Aug 10 2009
%Y A062763 Cf. A051696.
%K A062763 nonn
%O A062763 1,4
%A A062763 _Henry Bottomley_, Jul 16 2001