|
|
A079950
|
|
Triangle of n-th prime modulo twice primes less n-th prime.
|
|
4
|
|
|
2, 3, 3, 1, 5, 5, 3, 1, 7, 7, 3, 5, 1, 11, 11, 1, 1, 3, 13, 13, 13, 1, 5, 7, 3, 17, 17, 17, 3, 1, 9, 5, 19, 19, 19, 19, 3, 5, 3, 9, 1, 23, 23, 23, 23, 1, 5, 9, 1, 7, 3, 29, 29, 29, 29, 3, 1, 1, 3, 9, 5, 31, 31, 31, 31, 31, 1, 1, 7, 9, 15, 11, 3, 37, 37, 37, 37, 37, 1, 5, 1, 13, 19, 15, 7, 3, 41
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
T(n, k) = prime(n) mod 2*prime(k), 1<=k<=n.
|
|
EXAMPLE
|
Triangle begins:
2;
3, 3;
1, 5, 5;
3, 1, 7, 7;
3, 5, 1, 11, 11;
1, 1, 3, 13, 13, 13;
1, 5, 7, 3, 17, 17, 17;
...
|
|
MAPLE
|
modp(ithprime(n), 2*ithprime(k)) ;
end proc:
|
|
PROG
|
(PARI) T(n, k) = prime(n) % (2*prime(k));
tabl(nn) = for (n=1, nn, for (k=1, n, print1(T(n, k), ", ")); print); \\ Michel Marcus, Sep 21 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|