|
Search: id:A072752
|
|
|
| A072752 |
|
Maximum gap in one-stage prime-sieves. |
|
+0
2
|
|
| 1, 2, 4, 6, 10, 12, 16, 19, 22, 28, 32, 36, 44, 49, 52, 58
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
FORMULA
|
Let prime(n) be the sequence of primes, i.e. prime(1)=2. For n>=2 we define a(n) = max { m IN N | EXIST c(k) IN N, k=2, .., n : FOR ALL i IN {1, .., m} EXISTS j IN {2, .., n} : i == c(j) (mod prime(j)) }
|
|
EXAMPLE
|
a(5) = 6 because c(2)=2, c(3)=1, c(4)=4, c(5)=3 satisfy the requirements: 1 == 1 (mod 5), 2 == 2 (mod 3), 3 == 3 (mod 11), 4 == 4 (mod 7), 5 == 2 (mod 3), 6 == 1 (mod 5)
|
|
CROSSREFS
|
Cf. A072753.
Sequence in context: A006093 A127965 A117891 this_sequence A036634 A005942 A024907
Adjacent sequences: A072749 A072750 A072751 this_sequence A072753 A072754 A072755
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Mario Ziller (datalab(AT)gmx.de), Jul 10 2002
|
|
EXTENSIONS
|
2 more terms from Mario Ziller (datalab(AT)gmx.de), May 30 2005
|
|
|
Search completed in 0.002 seconds
|
