|
%I #15 May 02 2017 05:44:16
%S 1,1,2,1,1,2,1,2,1,4,1,1,3,6,2,1,2,2,3,6,4,1,1,4,5,8,6,2,1,2,3,2,1,10,
%T 6,4,1,2,4,1,7,3,12,10,6,1,1,1,3,9,5,14,12,8,2,1,1,2,2,4,11,3,18,14,8,
%U 6,1,2,1,6,8,2,7,3,18,12,10,4,1,1,3,1,10,4,9,5,20,14,12,6,2,1
%N Triangular array: T(k,j)=prime(k)(mod prime(j)), 1<=j<k.
%C Top edge: A001223
%C Row sums: A033955
%C Row maxs: A039731
%H Robert Israel, <a href="/A207409/b207409.txt">Table of n, a(n) for n = 1..10011</a> (first 141 rows, flattened)
%e Top 7 rows:
%e 1............. 3 mod 2
%e 1 2............5 mod 2, 5 mod 3
%e 1 1 2..........7 mod 2, 7 mod 3, 7 mod 4
%e 1 2 1 4
%e 1 1 3 6 2
%e 1 2 2 3 6 4
%e 1 1 4 5 8 6 2
%p P := select(isprime, [$1..100]):
%p seq(seq(P[k] mod P[j],j=1..k-1),k=1..nops(P)); # _Robert Israel_, May 01 2017
%t t = Table[Mod[Prime[k + 1], Prime[j]], {k, 1, 15},
%t {j, 1, k }];
%t Flatten[t] (* A207409 as a sequence *)
%t TableForm[t] (* A207409 as a triangle *)
%Y Cf. A000040.
%K nonn,tabl
%O 1,3
%A _Clark Kimberling_, Feb 17 2012
|
