Make a longer lenguage program Lenguage is a brainfuck dialect that is notorious for breaking source restriction challenges.  That is because Lenguage cares only about the length of it's source and not the contents.

First, the length of the program is calculated. Then, said length is converted to binary and left-padded by zeroes to a multiple of 3. The resulting binary string is split into chunks of 3 bits each of which is translated into a brainfuck command as such:

000 -&gt; +
001 -&gt; -
010 -&gt; &gt;
011 -&gt; &lt;
100 -&gt; .
101 -&gt; ,
110 -&gt; [
111 -&gt; ]


Finally the program is run as brainfuck1.

From here the challenge is pretty simple, write a lenguage program that takes no input and produces an output consisting of one byte repeated integer \$n\$ times, where \$n\$ is strictly greater than the length of your program.

Answers will be scored in bytes with fewer bytes being better.

Here's a hacky program to calculate lenguage from brainfuck



1: For this challenge we will use wrapping cells and a non-wrapping tape.
8437495638205698686671 bytes

This translates to the brainfuck program:

-[&gt;&gt;[&gt;]+[-&gt;[&gt;]+.[&lt;]+&lt;]&lt;-]


Which prints exactly \$231584178474632390847141970017375815706539969331281128078915168015826259279614\$ SOH bytes.

This is calculated by the function

f(n)=2*f(n-1)+n
f(0)=0


with an input of 255.

Explanation:

-[         Loop 255 times
  &gt;&gt;[&gt;]    Move to the end of a series of positive cells (initially empty)
  +        Add one cell to the end
  [-       Loop over each cell 
    &gt;[&gt;]+  Add one cell to the end
    .      Print a SOH byte
    [&lt;]+   Restore current cell
  &lt;]       Move to next cell
&lt;-]        Decrement counter