Busy Beavers are programs (specifically Turing Machine programs) that aim to output the most ones as possible, while having the least states as possible and halting.
Your challenge is to make a busy beaver, which outputs as many ones as possible, but also outputs a second busy beaver. That second busy beaver must be executable in the same language as the original program, and can be no more bytes than the program that produced it
So, for example, say my program was
a. That program should aim to print as many
1s as possible, and also output another program, say
b, which also aims to print as many
1s as possible and outputs another program etc etc etc.
b must be no more bytes than
The program should be printed after the
1s, separated by any reasonable delimiter.
The outputted programs must also not be the same as any of the previous programs. When no more programs are generated, the scores are calculated from there. For example, program
a can print
b can print
c can print
d doesn't print any other program. The scores would be calculated as
(a_ones + b_ones + c_ones + d_ones) / (a_bytes + b_bytes + c_bytes + d_bytes) (see below)
The programs must also never error. The "programs" can also be functions, as long as they execute with no arguments
Your submission's score is the sum of the number of ones outputted by your programs, all divided by the sum of the bytes of the programs. The higher the score, the better.