From: Victor Miller <victorsmiller@gmail.com>
Here's some answers (in addition you should look at Sol Golomb's Puzzle column in the Dec 2011 issue of the IEEE Information Theory Society Newsletter: http://www.itsoc.org/publications/newsletters/nits_NL_1211-Web.pdf/view which has a bunch of problems like this in even greater generality).
--thanks, Miller's were the solutions I had in mind, though I was not aware of Golomb column. In fact I'm still not aware of it since my computer refuses to open the pdf file, says it is "damaged." Anyway, I will now say what I worked out on this puzzle. If we choose n random uniformly from {1,2,...,N} in limit N-->infinity, then probability that the j-tuple n, n-1, n-2 ..., n+1-J (for some fixed J>=1) all are simultaneously free of Kth powers (for some fixed K>=2) is prf(J,K) = prod(primes p) (1 - J / p^K) or in MAPLE notation prf := (J,K,N) -> product( 1 - J / ithprime(m)^K, m=1..N ); in the limit N-->infinity. This is rigorous since the "probabilistic independence" is a rigorously valid statement in this case (e.g. see M.Kac's book if you don't understand what I mean by that). In the case J=1 we get prf(1,K) = 1/RiemannZeta(K) so prf(1,2) = 6/Pi^2 = 0.6079271016. The problem I posed was prf(2,2)=0.32263405 as best I've been able to determine (computed up to the 16000th prime and extrapolation to infinity). Also, ct:=0; for n from 1+10^6 by -1 to 2 do if( issqrfree(n) and issqrfree(n-1) ) then ct:=ct+1; fi; od; print(ct); prints 322619. Unfortunately I do not have any closed forms or rapid-convergent expressions except in the J=1 cases, although it is possible (albeit it seems to be hurting not helping) to transform the product to an interesting sum. One might dream that some of the loveliness of the zeta function, such as reflection formula, Riemann-Siegel integral formula, etc, has analogs for the more general prf function. I have no evidence for that, but since the Zeta function is a special case you would have at least a foothold to try to work on that. And as Miller noted, the chance that either n OR n-1 (or both) is squarefree is 2*prf(1,2) - prf(2,2) = 0.89322015.