Let E be a non-CM elliptic curve defined over Q. For each prime p of good reduction, E reduces to a curve E p over the finite field F p . For a given squarefree polynomial f (x, y), we examine the sequences f p (E) := f (a p (E), p), whose values are associated with the reduction of E over F p . We are particularly interested in two sequences: f p (E) = p + 1 − a p (E) and f p (E) = a p (E) 2 − 4p. We present two results towards the goal of determining how often the values in a given sequence are squarefree. First, for any fixed curve E, we give an upper bound for the number of primes p up to X for which f p (E) is squarefree. Moreover, we show that the conjectural asymptotic for the prime counting functionπ SF E,f (X) := #{p ≤ X : f p (E) is squarefree} is consistent with the asymptotic for the average over curves E in a suitable box.