The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; 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)).
LINKS
CROSSREFS
Cf. A076271.
Sequence in context: A302515 A303314 A349122 * A162620 A304115 A338365
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Oct 17 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 00:16 EDT 2024. Contains 372549 sequences. (Running on oeis4.)