We study the existence of various sign and value patterns in sequences defined by multiplicative functions or related objects. For any set A whose indicator function is "approximately multiplicative" and uniformly distributed on short intervals in a suitable sense, we show that the density of the pattern n + 1 ∈ A, n + 2 ∈ A, n + 3 ∈ A is positive, as long as A has density greater than 1 3 . Using an inverse theorem for sumsets and some tools from ergodic theory, we also provide a theorem that deals with the critical case of A having density exactly 1 3 , below which one would need nontrivial information on the local distribution of A in Bohr sets to proceed. We apply our results firstly to answer in a stronger form a question of Erdős and Pomerance on the relative orderings of the largest prime factors P + (n), P + (n + 1), P + (n + 2) of three consecutive integers. Secondly, we show that the tuple (ω(n + 1), ω(n + 2), ω(n + 3)) (mod 3) takes all the 27 possible patterns in (Z/3Z) 3 with positive lower density, with ω(n) being the number of distinct prime divisors. We also prove a theorem concerning longer patterns n + i ∈ Ai, i = 1, . . . k in approximately multiplicative sets Ai having large enough densities, generalising some results of Hildebrand on his "stable sets conjecture". Lastly, we consider the sign patterns of the Liouville function λ and show that there are at least 24 patterns of length 5 that occur with positive upper density. In all of the proofs we make extensive use of recent ideas concerning correlations of multiplicative functions.1 One could also include the n = 0 case here if one wished, although it will not affect our main results.2 For the precise definitions of the various densities used in this paper, as well as the standard arithmetic functions and asymptotic notation, see Subsection 1.7. 1 arXiv:1904.05096v2 [math.NT] 3 Sep 2019 1 d 2 , one can easily show that the Chowla conjectures for the Liouville and Möbius functions are equivalent if one generalises the distinct linear forms n + h1, .. . , n + h k to non-parallel affine forms a1n + h1, . . . , a k n + h k ; we omit the details. 5 We say that f is completely multiplicative if f (mn) = f (m)f (n) for all m, n ∈ N and f (1) = 1. 6 In [42], the proof was written only for f = λ, but the exact same argument works for any completely multiplicative bounded f that is not weakly pretentious.