login
Triangle read by rows: for 1 <= k <= n, a(n, k) = n^k mod k.
4

%I #9 Apr 14 2020 19:50:53

%S 0,0,0,0,1,0,0,0,1,0,0,1,2,1,0,0,0,0,0,1,0,0,1,1,1,2,1,0,0,0,2,0,3,4,

%T 1,0,0,1,0,1,4,3,2,1,0,0,0,1,0,0,4,3,0,1,0,0,1,2,1,1,1,4,1,8,1,0,0,0,

%U 0,0,2,0,5,0,0,4,1,0,0,1,1,1,3,1,6,1,1,9,2,1,0,0,0,2,0,4,4,0,0,8,6,3,4,1,0

%N Triangle read by rows: for 1 <= k <= n, a(n, k) = n^k mod k.

%H Harvey P. Dale, <a href="/A094263/b094263.txt">Table of n, a(n) for n = 1..1000</a>

%t Table[PowerMod[n,k,k],{n,20},{k,n}]//Flatten (* _Harvey P. Dale_, Apr 14 2020 *)

%Y Cf. A094264, A094265.

%K nonn,easy,tabl,less

%O 1,13

%A _Amarnath Murthy_, Apr 26 2004

%E Edited and extended by _David Wasserman_, Jan 24 2007