|
|
A071056
|
|
Smallest number m such that m = p(i) mod p(i)^2 for 1<=i<=n.
|
|
0
|
|
|
2, 30, 30, 40530, 4626930, 127357230, 198523555230, 24957467264730, 38787559738857930, 6210320711698633530, 36463596777769821089430, 44001853246673879187761130, 67005904883201525523410858730
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
p(i)^2 is the least composite whose GCD is 1 for all previous composites.
|
|
LINKS
|
|
|
MATHEMATICA
|
Needs["NumberTheory`NumberTheoryFunctions`"]; Table[p = Table[Prime[i], {i, 1, n}]; ChineseRemainder[p, p^2], {n, 1, 15}]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|