OFFSET
2,3
COMMENTS
Conjecture: For each row in the triangle, the maximum value occurs only once, and for n>2 it is never the first entry and the value previous to it in the row is always odd. - Mike Jones, Jul 12 2024
LINKS
Robert Israel, Table of n, a(n) for n = 2..10012 (first 141 rows, flattened)
EXAMPLE
Top 7 rows:
n=2: 1............. 3 mod 2
n=3: 1 2............5 mod 2, 5 mod 3
n=4: 1 1 2..........7 mod 2, 7 mod 3, 7 mod 5
n=5: 1 2 1 4
n=6: 1 1 3 6 2
n=7: 1 2 2 3 6 4
n=8: 1 1 4 5 8 6 2
MAPLE
P := select(isprime, [$1..100]):
seq(seq(P[n] mod P[k], k=1..n-1), n=1..nops(P)); # Robert Israel, May 01 2017
MATHEMATICA
t = Table[Mod[Prime[n + 1], Prime[k]], {n, 1, 15}, {k, 1, n }];
Flatten[t] (* this sequence *)
TableForm[t] (* this sequence as a triangle *)
PROG
(PARI) row(n) = my(p=prime(n)); vector(n-1, k, p % prime(k)); \\ Michel Marcus, Jul 13 2024
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Feb 17 2012
STATUS
approved
