I have something to check. It is about prime constant (I don't know if it is officially so called), but it is created on following way. We start with binary point number represenation. Zero followed by point and then if the number is prime we write an one if not we write a zero and so on filling the empty places this way. Now when we have this array of a bigger length we can transform it in simple black white bitmap. We open the file in hex-editor changing the hex values of zeros and ones to 00 and FF to form bitmap. In my case I have the array of length 10000 it is divisable by four and needs no paddings in bitmap file. The header of bitmap file is created in gimp with an empty file bmp with 100x100px . The results are surprising , and that is the question to the forum: First to check if there isn't an error in this process of bitmap creation and secondly if not to interpret the results. I will attach the bitmap file and also the bitmap file from binary representation of Pi just to compare created in same manner. I personally expected great randomness as by Pi bitmap but in prime constant bitmap there are great regularities. Any explanation or simply an error?
PS: I am not able to post pictures due to reputation. Is there another way to show what is all about?