A071056 Smallest number m such that m = p(i) mod p(i)^2 for 1<=i<=n.

2, 30, 30, 40530, 4626930, 127357230, 198523555230, 24957467264730, 38787559738857930, 6210320711698633530, 36463596777769821089430, 44001853246673879187761130, 67005904883201525523410858730

Offset

1,1

Comments

p(i)^2 is the least composite whose GCD is 1 for all previous composites.

Links

Table of n, a(n) for n=1..13.

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: A078690 A228937 A381086 * A075716 A073418 A022377

Adjacent sequences: A071053 A071054 A071055 * A071057 A071058 A071059

Keyword

nonn

Author

Robert G. Wilson v, May 25 2002

Status

approved