|
Search: id:A072562
|
|
|
| A072562 |
|
Smallest of exactly n consecutive integers divisible respectively by n consecutive primes. |
|
+0
8
|
|
| 4, 2, 8, 158, 3098, 788, 210998, 5316098, 34415168, 703693778, 194794490678, 5208806743928, 138782093170508, 5006786309605868, 253579251611336438, 12551374903381164638, 142908008812141343558, 77053322014980646906358
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(n) often equals A069561(n).
|
|
FORMULA
|
If A069561(n+1) = A069561(n), then a(n) = A069561(n) + A002110(n). Otherwise, then a(n) = A069561(n). - David Wasserman (wasserma(AT)spawar.navy.mil), Oct 21 2004
|
|
EXAMPLE
|
a(3)=158 because 158 is the least number such that 158, 159, 160 and 161 are divisible by 4 consecutive primes, namely 2, 3, 5 and 7 respectively.
|
|
MATHEMATICA
|
f[n_Integer] := Flatten[ Table[ #1] & @@@ FactorInteger[n]]; NextPrim[n_] := Block[ {k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; m = 2; Do[ While[p = f[m]; l = Length[p]; t = Table[m + i, {i, 0, n - 1}]; k = 1; While[k < l + 1 && Union[ Mod[t, NestList[ NextPrim, p[[k]], n - 1]]] != {0}, k++ ]; k == l + 1, m++ ]; Print[m], {n, 2, 50}]
|
|
CROSSREFS
|
Cf. A073606, A073607, A072555, A069561.
Sequence in context: A040174 A084477 A046589 this_sequence A143311 A016696 A127470
Adjacent sequences: A072559 A072560 A072561 this_sequence A072563 A072564 A072565
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Aug 06 2002
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Oct 21 2004
|
|
|
Search completed in 0.002 seconds
|
