Assuming you are not allowing repeats, I reckon you can do this by the Inclusion-Exclusion principle as follows:
Let A be the event "the sequence 1,2 appears in your playlist"
Let B be the event "the sequence 2,3 appears in your playlist"
...
Let I be the event "the sequence 9,10 appears in your playlist"
The Inclusion-Exclusion principle says:
p(A U B U ... U I) =
p(A) + p(B) + p(C) + ... + p(I)
- p(A ∩ B) - p(A ∩ C) - ... - p(H ∩ I)
+ p(A ∩ B ∩ C) + p(A ∩ B ∩ D) + ... + p(G ∩ H ∩ I)
- ...
+ ...
...
+ p(A ∩ B ∩ C ∩ D ∩ E ∩ F ∩ G ∩ H ∩ I)
[where p(A∩B) is the probability of A AND B occuring, and p(AUB) is the probability of A OR B OR both occuring]
What you're after is the left-hand side, the probability that at least one of the events A to I occurs. So if we can evaluate the left-hand side, we're done.
P(A) = 9x8!/10! (since there are 8! ways to arrange 3,4,5,6,7,8,9,10, and having arranged them there are 9 gaps to slot 1,2 into. So 9! ways out of 10! have 1,2 in them)
Fairly obviously, P(A) = P(B) = ... = P(I) = 9x8!/10! = 1/10
P(A∩B) = 8x7!/10! (since A∩B is the event "1,2,3 occurs in the playlist", then use a similar argument to above.) Fairly obviously, P(A∩B) = P(B∩C) = P(C∩D) = ..., so all these terms with two consecutive letters are 8!/10!.
However, this leaves terms like P(A∩C) where the letters are not consecutive. But it turns out that these are all equal to 8!/10! as well. (example: p(A∩C) = 8x7x6!/10!, since there are 6! ways to permute 5,6,7,8,9,10, then 7 slots to fit 1,2 into, then 8 slots to fit 3,4 into).
You can use a whole host of similar arguments to prove that P(? ∩ ? ∩ ?) = 7!/10!, P(? ∩ ? ∩ ? ∩ ?) = 6!/10!, etc.
So p(A U B U ... U I) = [(9C1)x9! - (9C2)x8! + (9C3)x7! - ... + (9C9)x1!]/10! Which is disgusting. I make it about 0.595.