Intuitively your sequence is not random so I'll not go there.
Rather I'll address why you might think that it is, based on the NIST test suite. From my experience, the suite's implementation is not very reliable (AKA rubbish). I'm sure the math is good, but it's the 3rd party implementations that are suspect. I'm not sure which code you're running, I couldn't get the de faco NIST source code to compile properly. The NIST documentation is useless even though it runs to 100's pages. So you're left with Fred's own implementation from GitHub, written in someone's spare time between watching the football. Considering the sophistication of the statistics knowledge required to code and test such software, I'm extremely dubious as to NIST test results.
Clearly my doubts are well founded if your non random test sample passed NIST, especially section 3.12 (Approximate Entropy Test). The test should have calculated an entropy of 4 bits /byte and vigorously waved a large red flag spitting out an extreme p value. Most people do not know how to correctly use Shannon's log (Px) formula for entropy, and either NIST or Fred are amongst them. Respectfully, you may not have configured the tests correctly either I guess. NIST is extremely difficult which is why you can't find any command line examples of it's use on the Internet.
One of the simplest randomness tests is compression. A truly random sequence is incompressible. Use a good quality compressor like 7z or fp8 (avoid zip as that fails like NIST does). When you compress your sample file, you'll see it reduces to half size. Ergo, it's not random.