Longest repeated sequence in the prime counting function

[Loren Booda]

Is there a longest repeated sequence (congruency) in the prime counting function \pi (x) (that which gives the number of primes less than or equal to x)?

Recall that \pi (x) , although infinite, may not be random, and itself starts out with an unrepeated sequence \pi (2)=1 and \pi (3)=2 (with a "slope" of 1).

[CRGreathouse]

I really can't tell what you mean. Could you explain what you mean more carefully, maybe with an example?

[Simon-M]

There are arbitrarily large gaps in the prime numbers. This means that \pi(n) can be constant over an arbitrarily large interval.

Consider the n-1 numbers n!+k[/latex] where [latex]k=2,3,\cdots n

[Loren Booda]

I think that Simon-M answered my question, and with a basic example - that the prime counting function as graphed can repeat itself indefinitely (such as when constant over an arbitrarily large interval). Another example would include the interjection of one prime into such an arbitrarily large sequence, which then could be repeated.