Croatian Conjecture: programs and output (lasic_oblak, 22 November 2026)

big.py     sieve of mu up to 5*10^7 and the recursion S(m) = 1 - sum_{k>=2} S(floor(m/k)) on LL(n);
           row(n) returns the sum of absolute values of the last row of RAMA on LL(n), the order K,
           S(n), e(n); Dfun(K) is the divisor sum D(K).  Run as a script it prints the rows for 10^8..10^12.
big.out    its output.
samp.py    random n (uniform in log n) in [10^7,10^10), windows of 1001 consecutive n, powers of 2.
samp.out   its output.
full7.py   every n from 1 to 10^7: sum of absolute values against D(K).
full7.out  its output.
first.py   every n from 1 to 10^7: |e(n)| against r(n) + r(floor(n/2)).
first.out  its output.
Python 3 with numpy.  Each program was run once.
