Quantum random access codes (QRACs) are important communication tasks that are usually implemented in prepare-and-measure scenarios. The receiver tries to retrieve one arbitrarily chosen bit of the original bit-string from the code qubit sent by the sender. In this Letter, we analyze in detail the sequential version of the 3→1 QRAC with two receivers. The average successful probability for the strategy of unsharp measurement is derived. The prepare-and-measure strategy within projective measurement is also discussed. It is found that sequential 3→1 QRAC with weak measurement cannot be always superior to the one with projective measurement, as the 2→1 version can be.