|
| |
|
|
A076918
|
|
a(1) = 1, a(n+1) = A076271(n+1) divided by the highest common factor of A076271(n) and A076271(n+1).
|
|
0
| |
|
|
1, 2, 2, 3, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 13, 12, 13, 14, 15, 16, 17, 14, 15, 16, 17, 18, 19, 18, 19, 20, 21, 22, 23, 20
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| If a(k) is the first occurrence of a prime p(r), the r-th prime then a(k+1) = p(r-1) + 1,... a(k+m) = p(r-1) + m until a(k + p(r)-p(r-1))= p(r) again.( the second and the last occurrence of p(r)).
|
|
|
CROSSREFS
| Cf. A076271.
Sequence in context: A136537 A153928 A119446 * A162620 A194249 A082997
Adjacent sequences: A076915 A076916 A076917 * A076919 A076920 A076921
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 17 2002
|
| |
|
|
