[go: up one dir, main page]

login
Triangle read by rows: T(n,k) = prime(k)^(n-1) mod prime(n), 1 <= k <= n.
2

%I #18 Jun 29 2024 16:45:23

%S 1,2,0,4,4,0,1,6,6,0,5,4,9,3,0,6,9,5,11,7,0,13,15,2,9,8,16,0,14,2,16,

%T 7,11,10,5,0,3,6,16,12,8,2,18,9,0,19,21,4,20,2,5,17,11,7,0,1,25,5,25,

%U 5,5,25,25,1,1,0,13,28,2,12,27,15,32,20,29,23,6,0,37,40,16,31,23,4,23,31,37,25,18,16,0

%N Triangle read by rows: T(n,k) = prime(k)^(n-1) mod prime(n), 1 <= k <= n.

%C First column is A175036.

%e Triangle begins:

%e 1;

%e 2, 0;

%e 4, 4, 0;

%e 1, 6, 6, 0;

%e 5, 4, 9, 3, 0;

%p A177806 := proc(n,k) modp((ithprime(k))^(n-1), ithprime(n)) ; end proc:

%p seq(seq(A177806(n,k),k=1..n),n=1..15) ;

%t Table[PowerMod[Prime[Range[n]], n-1, Prime[n]], {n, 15}] (* _Paolo Xausa_, Jun 29 2024 *)

%Y Cf. A000079, A177226.

%K nonn,tabl

%O 1,2

%A _Juri-Stepan Gerasimov_, Dec 12 2010