Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076918
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
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; listen)
OFFSET

1,2

COMMENT

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.

Adjacent sequences: A076915 A076916 A076917 this_sequence A076919 A076920 A076921

Sequence in context: A035679 A136537 A119446 this_sequence A082997 A085970 A066683

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 17 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research