|
Search: id:A071056
|
|
|
| A071056 |
|
Smallest number m such that m = p(i) mod p(i)^2 for 1<=i<=n. |
|
+0
1
|
|
| 2, 30, 30, 40530, 4626930, 127357230, 198523555230, 24957467264730, 38787559738857930, 6210320711698633530, 36463596777769821089430, 44001853246673879187761130, 67005904883201525523410858730
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
p(i)^2 is the least composite whose GCD is 1 for all previous composites.
|
|
MATHEMATICA
|
Needs["NumberTheory`NumberTheoryFunctions`"]; Table[p = Table[Prime[i], {i, 1, n}]; ChineseRemainder[p, p^2], {n, 1, 15}]
|
|
CROSSREFS
|
Cf. A053664.
Sequence in context: A087194 A058988 A078690 this_sequence A075716 A022377 A145290
Adjacent sequences: A071053 A071054 A071055 this_sequence A071057 A071058 A071059
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), May 25 2002
|
|
|
Search completed in 0.002 seconds
|
