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

%I #12 Jun 29 2024 16:12:32

%S 1,0,2,0,1,4,0,2,3,1,0,1,1,2,5,0,2,2,4,10,6,0,1,4,1,9,12,13,0,2,3,2,7,

%T 11,9,14,0,1,1,4,3,9,1,9,3,0,2,2,1,6,5,2,18,6,19,0,1,4,2,1,10,4,17,12,

%U 9,1,0,2,3,4,2,7,8,15,1,18,2,13,0,1,1,1,4,1,16,11,2,7,4,26,37,0,2,2,2,8,2,15

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

%e Triangle begins:

%e 1;

%e 0, 2;

%e 0, 1, 4;

%e 0, 2, 3, 1;

%e 0, 1, 1, 2, 5;

%e 0, 2, 2, 4,10, 6;

%e 0, 1, 4, 1, 9,12,13;

%e 0, 2, 3, 2, 7,11, 9,14;

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

%t Flatten[Table[Mod[2^(n-1),Prime[k]],{n,14},{k,n}]]

%Y Cf. A174620.

%K nonn,tabl

%O 1,3

%A _Juri-Stepan Gerasimov_, Dec 02 2010

%E Corrected by _T. D. Noe_, Dec 02 2010