|
|
A207409
|
|
Triangular array: T(k,j)=prime(k)(mod prime(j)), 1<=j<k.
|
|
5
|
|
|
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, 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, 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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Top 7 rows:
1............. 3 mod 2
1 2............5 mod 2, 5 mod 3
1 1 2..........7 mod 2, 7 mod 3, 7 mod 4
1 2 1 4
1 1 3 6 2
1 2 2 3 6 4
1 1 4 5 8 6 2
|
|
MAPLE
|
P := select(isprime, [$1..100]):
seq(seq(P[k] mod P[j], j=1..k-1), k=1..nops(P)); # Robert Israel, May 01 2017
|
|
MATHEMATICA
|
t = Table[Mod[Prime[k + 1], Prime[j]], {k, 1, 15},
{j, 1, k }];
Flatten[t] (* A207409 as a sequence *)
TableForm[t] (* A207409 as a triangle *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|