blocks|key|1401038|text|图2，8\log_{256}(96)\approx+6.585字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1401039|eLG2'_Ob|code-block|syntax|javascript|1401040|在网上试试！|unstyled|1401041|维沙尔港|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Seggan/Fig|1|INLINETEX|IMMUTABLE|teX|8\log_{256}(96)\approx|2|https://fig.fly.dev/#WyJlTEcyJ19PYiIsIiJd^0|3|M|0|2|0|3|M|1|0|0|0|6|2|0^^$0|@$1|2|3|4|5|6|7|13|8|@$9|14|A|15|B|C]]|D|@$9|16|A|17|1|18]|$9|19|A|1A|1|1B]]|E|$]]|$1|F|3|G|5|H|7|1C|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|M|7|1D|8|@]|D|@$9|1E|A|1F|1|1G]]|E|$]]|$1|N|3|O|5|M|7|1H|8|@]|D|@]|E|$]]]|P|$Q|$5|R|S|T|E|$U|V]]|W|$5|X|S|Y|E|$Z|10]]|11|$5|R|S|T|E|$U|12]]]]

<h1><a href="https://github.com/Seggan/Fig" rel="noreferrer">Fig</a>, <span class="math-container">\$8\log_{256}(96)\approx\$</span> 6.585 bytes</h1>
<pre><code>eLG2'_Ob
</code></pre>
<p><a href="https://fig.fly.dev/#WyJlTEcyJ19PYiIsIiJd" rel="noreferrer">Try it online!</a></p>
<p>Port of Vyxal</p>


blocks|key|1392465|text|K+(ngn/k)，14字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1392466|{#$x(10/2\)/2}|code-block|syntax|javascript|1392467|在网上试试！|unstyled|1392468|输出第n个元素。|1392469|不幸的是，这只能执行前3个元素，因为它是用C编写的，因此溢出发生得非常快。|entityMap|0|LINK|mutability|MUTABLE|url|https://codeberg.org/ngn/k|1|https://ngn.codeberg.page/k#eJxLs6pWVqnQMDTQN4rR1Deq5eJKUzfUVjQGAEsCBXk=^0|0|9|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|18|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://codeberg.org/ngn/k" rel="noreferrer">K (ngn/k)</a>, 14 bytes</h1>
<pre><code>{#$x(10/2\)/2}
</code></pre>
<p><a href="https://ngn.codeberg.page/k#eJxLs6pWVqnQMDTQN4rR1Deq5eJKUzfUVjQGAEsCBXk=" rel="noreferrer">Try it online!</a></p>
<p>Outputs the nth element.</p>
<p>Unfortunately, this can only do the first 3 elements because it's written in C, so overflow happens very quickly.</p>


blocks|key|1392124|text|因子，35字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1392125|2+[+>bin+dup+length+.+dec>+t+]+loop|code-block|syntax|javascript|1392126|打印以2开始的无限序列，在TIO上超时，但是这里有一个屏幕截图，它使用调试器来执行一些开始迭代：|unstyled|1392127|📷|atomic|entityMap|0|LINK|mutability|MUTABLE|url|https://factorcode.org/|1|IMAGE|IMMUTABLE|imageUrl|https://i.stack.imgur.com/AHnll.gif|imageAlt^0|0|2|0|0|0|0|0|1|1^^$0|@$1|2|3|4|5|6|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|D|3|E|5|F|7|15|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|16|8|@]|9|@]|C|$]]|$1|L|3|M|5|N|7|17|8|@]|9|@$A|18|B|19|1|1A]]|C|$]]]|O|$P|$5|Q|R|S|C|$T|U]]|V|$5|W|R|X|C|$Y|Z|10|-4]]]]

<h1><a href="https://factorcode.org/" rel="nofollow noreferrer">Factor</a>, 35 bytes</h1>
<pre class="lang-factor prettyprint-override"><code>2 [ &gt;bin dup length . dec&gt; t ] loop
</code></pre>
<p>Prints the infinite sequence starting with 2. Times out on TIO, but here's a screenshot using the debugger to step through some of the starting iterations:</p>
<p><a href="https://i.stack.imgur.com/AHnll.gif" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/AHnll.gif" alt="enter image description here" /></a></p>


blocks|key|1401620|text|序列，9+\log_{256}(96)\approx+7.4字节|type|header-two|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|1401621|2HE2hBnHz|code-block|syntax|javascript|1401622|解释|1401623|2HE2hBnHz
++E++++++++//+Infinite+sequence
2H+++++++++//+Starting+with+2
+++++++++++//+For+each+term:
+++2hB+++++//+++Convert+to+binary
++++++n++++//+++Interpret+as+integer
+++++++H+++//+++And+use+this+as+the+next+term
++++++++z++//+++Get+the+length+and+output+implicitly|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/nayakrujul/sequences|1|INLINETEX|IMMUTABLE|teX|9+\log_{256}(96)\approx^0|3|N|0|2|0|3|N|1|0|0|0^^$0|@$1|2|3|4|5|6|7|10|8|@$9|11|A|12|B|C]]|D|@$9|13|A|14|1|15]|$9|16|A|17|1|18]]|E|$]]|$1|F|3|G|5|H|7|19|8|@]|D|@]|E|$I|J]]|$1|K|3|L|5|6|7|1A|8|@]|D|@]|E|$]]|$1|M|3|N|5|H|7|1B|8|@]|D|@]|E|$I|J]]]|O|$P|$5|Q|R|S|E|$T|U]]|V|$5|W|R|X|E|$Y|Z]]]]

<h1><a href="https://github.com/nayakrujul/sequences" rel="nofollow noreferrer">Sequences</a>, <span class="math-container">\$9 \log_{256}(96)\approx\$</span> 7.4 bytes</h1>
<pre><code>2HE2hBnHz
</code></pre>
<h3>Explanation</h3>
<pre class="lang-js prettyprint-override"><code>2HE2hBnHz
  E        // Infinite sequence
2H         // Starting with 2
           // For each term:
   2hB     //   Convert to binary
      n    //   Interpret as integer
       H   //   And use this as the next term
        z  //   Get the length and output implicitly
</code></pre>


blocks|key|1391844|text|C+(gcc)，67字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1391845|q;b;v;f(n){for(v=2;n--;v=q)for(b=q=0;v;v/=2)q%2B=v%252*exp10(b%2B%2B);q=b;}|code-block|syntax|javascript|1391846|在网上试试！|unstyled|1391847|输入1-based+n。|style|CODE|1391848|1391849|返回以n%5E{\text{th}}开头的a(1)+=+2元素。|entityMap|0|LINK|mutability|MUTABLE|url|https://gcc.gnu.org/|1|https://tio.run/##VVDZbsIwEHznK1aRkBKSCB@5LNd9qfoVhQdiHIoKgRxNUVF@vek6HC2WvN6ZnVl5V4cbrYehkrnsZOGW3rk41G6nmCzDUHaq8izOVaUICrq5Yl7lq27KZuZ0pMTNfd@TlcplP2zLFvarbel6cJ4AHkugyujWrN@WoODMAogCoCQATnsJ8zlYZCEnNhMc04RlmDMSCVQTwpCjnImYIoxoYl8aJSm1lihLeSKsPqGCkBRrMU8zxqyZplmSkDSxpOCRyKiwrEhpHGeci16O39SHsmlBv6/qGUajP0x9@a2zOL2yxUm84I2dAP5j7lzduB5w7aTbcm1OaCPymj5Bs/02h8K97cCD@Y2a3TkJvj/qb1u7ba7FXpdGPlD5UGqwVLit98gaZO/rHp3LP8GxRknhOtM1hM@AcdosSpypDaAJ7mM3SpnltW0/xtq0n3WJQ0364UcXu9WmGcKvIdztfwE|2|INLINETEX|IMMUTABLE|teX|3|n|4|n%5E{\text{th}}|5|a(1)+=+2^0|0|7|0|0|0|0|6|1|0|2|1|A|1|2|1|2|A|1|3|0|0|3|D|J|8|3|D|4|J|8|5^^$0|@$1|2|3|4|5|6|7|1B|8|@]|9|@$A|1C|B|1D|1|1E]]|C|$]]|$1|D|3|E|5|F|7|1F|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1G|8|@]|9|@$A|1H|B|1I|1|1J]]|C|$]]|$1|L|3|M|5|K|7|1K|8|@$A|1L|B|1M|N|O]|$A|1N|B|1O|N|O]]|9|@$A|1P|B|1Q|1|1R]|$A|1S|B|1T|1|1U]]|C|$]]|$1|P|3|-4|5|K|7|1V|8|@]|9|@]|C|$]]|$1|Q|3|R|5|K|7|1W|8|@$A|1X|B|1Y|N|O]|$A|1Z|B|20|N|O]]|9|@$A|21|B|22|1|23]|$A|24|B|25|1|26]]|C|$]]]|S|$T|$5|U|V|W|C|$X|Y]]|Z|$5|U|V|W|C|$X|10]]|11|$5|12|V|13|C|$14|Z]]|15|$5|12|V|13|C|$14|16]]|17|$5|12|V|13|C|$14|18]]|19|$5|12|V|13|C|$14|1A]]]]

<h1><a href="https://gcc.gnu.org/" rel="nofollow noreferrer">C (gcc)</a>, 67 bytes</h1>

<pre class="lang-c prettyprint-override"><code>q;b;v;f(n){for(v=2;n--;v=q)for(b=q=0;v;v/=2)q+=v%2*exp10(b++);q=b;}
</code></pre>
<p><a href="https://tio.run/##VVDZbsIwEHznK1aRkBKSCB@5LNd9qfoVhQdiHIoKgRxNUVF@vek6HC2WvN6ZnVl5V4cbrYehkrnsZOGW3rk41G6nmCzDUHaq8izOVaUICrq5Yl7lq27KZuZ0pMTNfd@TlcplP2zLFvarbel6cJ4AHkugyujWrN@WoODMAogCoCQATnsJ8zlYZCEnNhMc04RlmDMSCVQTwpCjnImYIoxoYl8aJSm1lihLeSKsPqGCkBRrMU8zxqyZplmSkDSxpOCRyKiwrEhpHGeci16O39SHsmlBv6/qGUajP0x9@a2zOL2yxUm84I2dAP5j7lzduB5w7aTbcm1OaCPymj5Bs/02h8K97cCD@Y2a3TkJvj/qb1u7ba7FXpdGPlD5UGqwVLit98gaZO/rHp3LP8GxRknhOtM1hM@AcdosSpypDaAJ7mM3SpnltW0/xtq0n3WJQ0364UcXu9WmGcKvIdztfwE" rel="nofollow noreferrer" title="C (gcc) – Try It Online">Try it online!</a></p>
<p>Inputs <span class="math-container">\$1\$</span>-based <span class="math-container">\$n\$</span>.<br />
Returns the <span class="math-container">\$n^{\text{th}}\$</span> element starting with <span class="math-container">\$a(1) = 2\$</span>.</p>


blocks|key|1401145|text|皮斯，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1401146|L.BsbmlyF2|code-block|syntax|javascript|1401147|测试套件|unstyled|1401148|打印第一个n术语。|style|CODE|1401149|可以省略m以代替打印a(n)，其中的a(0)=2。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/isaacg1/pyth|1|https://pythtemp.herokuapp.com/?code=L.BsbmlyF2&test_suite=1&test_suite_input=2%250A5%250A10&debug=0|2|INLINETEX|IMMUTABLE|teX|n|3|a(n)|4|a(0)=2^0|0|2|0|0|0|0|4|1|0|5|1|5|1|2|0|4|1|A|4|I|6|A|4|3|I|6|4^^$0|@$1|2|3|4|5|6|7|19|8|@]|9|@$A|1A|B|1B|1|1C]]|C|$]]|$1|D|3|E|5|F|7|1D|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1E|8|@]|9|@$A|1F|B|1G|1|1H]]|C|$]]|$1|L|3|M|5|K|7|1I|8|@$A|1J|B|1K|N|O]]|9|@$A|1L|B|1M|1|1N]]|C|$]]|$1|P|3|Q|5|K|7|1O|8|@$A|1P|B|1Q|N|O]|$A|1R|B|1S|N|O]|$A|1T|B|1U|N|O]]|9|@$A|1V|B|1W|1|1X]|$A|1Y|B|1Z|1|20]]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|11|U|12|C|$13|14]]|15|$5|11|U|12|C|$13|16]]|17|$5|11|U|12|C|$13|18]]]]

<h1><a href="https://github.com/isaacg1/pyth" rel="nofollow noreferrer">Pyth</a>, 10 bytes</h1>
<pre><code>L.BsbmlyF2
</code></pre>
<p><a href="https://pythtemp.herokuapp.com/?code=L.BsbmlyF2&amp;test_suite=1&amp;test_suite_input=2%0A5%0A10&amp;debug=0" rel="nofollow noreferrer">Test suite</a></p>
<p>Prints the first <span class="math-container">\$n\$</span> terms.</p>
<p>The <code>m</code> can be omitted to instead print <span class="math-container">\$a(n)\$</span>, where <span class="math-container">\$a(0)=2\$</span>.</p>


blocks|key|1401362|text|APL+(dzaima/APL)，19字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1401363|{≢⍕(10⊥2∘⊥⍣¯1)⍣⍵⊢2}|code-block|syntax|javascript|1401364|在网上试试！|unstyled|1401365|由于限制，这也只能输出前5个元素。|1401366|这也适用于Dyalog，但只能输出前3个元素。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/dzaima/APL|1|https://tio.run/##SyzI0U2pSszMTfz/P@1R24TqR52LHvVO1TA0eNS11OhRxwwg9ah38aH1hppA6lHv1kddi4xq/z/qmwpUnHZohaGCkYKxgomC6X8A^0|0|G|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|K|7|18|8|@]|9|@]|C|$]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/dzaima/APL" rel="nofollow noreferrer">APL (dzaima/APL)</a>, 19 bytes</h1>

<pre class="lang-apl prettyprint-override"><code>{≢⍕(10⊥2∘⊥⍣¯1)⍣⍵⊢2}
</code></pre>
<p><a href="https://tio.run/##SyzI0U2pSszMTfz/P@1R24TqR52LHvVO1TA0eNS11OhRxwwg9ah38aH1hppA6lHv1kddi4xq/z/qmwpUnHZohaGCkYKxgomC6X8A" rel="nofollow noreferrer" title="APL (dzaima/APL) – Try It Online">Try it online!</a></p>
<p>Due to limits, this can also only output the first 5 elements.</p>
<p>This works in Dyalog too, but can only output the first 3 elements there.</p>


blocks|key|1401672|text|PARI/GP+55字节|type|header-two|depth|inlineStyleRanges|entityRanges|data|1401673|f(n)=k=2;d=digits;while(n--,k=fromdigits(d(k,2)));#d(k)|code-block|syntax|javascript|1401674|8+GBytes堆栈溢出到n=18。|unstyled|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|K|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|L|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|I|7|M|8|@]|9|@]|A|$]]]|J|$]]

<h1>PARI/GP 55 bytes</h1>
<pre><code>f(n)=k=2;d=digits;while(n--,k=fromdigits(d(k,2)));#d(k)
</code></pre>
<p>Stack of 8 GBytes overflows for n=18.</p>


blocks|key|1393332|text|J，18字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1393333|[:#@":10x&(#.#:)&2|code-block|syntax|javascript|1393334|在网上试试！|unstyled|1393335|-2多亏了约拿！|entityMap|0|LINK|mutability|MUTABLE|url|https://www.jsoftware.com/|1|https://ato.pxeger.com/run?1=m70wa8FOJT31NAVbKwV1BR0FAwUrINbVU3AO8nFbWlqSpmuxKdpK2UHJytCgQk1DWU_ZSlPNCCKxS5MrNTkjXyFNQU3PDqjLUMFIwVjBRMFUwQyiYMECCA0A^0|0|1|0|0|0|0|6|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://www.jsoftware.com" rel="nofollow noreferrer">J</a>, 18 bytes</h1>
<pre><code>[:#@&quot;:10x&amp;(#.#:)&amp;2
</code></pre>
<p><a href="https://ato.pxeger.com/run?1=m70wa8FOJT31NAVbKwV1BR0FAwUrINbVU3AO8nFbWlqSpmuxKdpK2UHJytCgQk1DWU_ZSlPNCCKxS5MrNTkjXyFNQU3PDqjLUMFIwVjBRMFUwQyiYMECCA0A" rel="nofollow noreferrer">Attempt This Online!</a></p>
<p>-2 thanks to Jonah!</p>


blocks|key|1400904|text|JavaScript+(Node.js)，54字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1400905|-3字节，多亏了@Sʨɠɠan|unstyled|1400906|无限期地打印序列，从2开始(OP现在允许)。|style|CODE|1400907|for(n=2;;console.log(n.length))n=BigInt(n).toString(2)|code-block|syntax|javascript|1400908|在网上试试！|entityMap|0|LINK|mutability|MUTABLE|url|https://nodejs.org/|1|https://codegolf.stackexchange.com/users/92689/s%25ca%25a8%25c9%25a0%25c9%25a0an|2|INLINETEX|IMMUTABLE|teX|3|https://tio.run/##BcExDoAgDAXQ67SDDKzExc3ZExDEiiG/BhqvX9978pdnGe21BXpW90sHYY0pFcXUXkNXIYReIXYzY92a7DACB9PDRoNQZPcf^0|0|K|0|0|8|7|1|0|A|1|A|1|2|0|0|0|6|3^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@$A|17|B|18|1|19]]|C|$]]|$1|D|3|E|5|F|7|1A|8|@]|9|@$A|1B|B|1C|1|1D]]|C|$]]|$1|G|3|H|5|F|7|1E|8|@$A|1F|B|1G|I|J]]|9|@$A|1H|B|1I|1|1J]]|C|$]]|$1|K|3|L|5|M|7|1K|8|@]|9|@]|C|$N|O]]|$1|P|3|Q|5|F|7|1L|8|@]|9|@$A|1M|B|1N|1|1O]]|C|$]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|11|U|12|C|$13|10]]|14|$5|T|U|V|C|$W|15]]]]

<h1><a href="https://nodejs.org" rel="nofollow noreferrer">JavaScript (Node.js)</a>, 54 bytes</h1>
<p><em>-3 bytes thanks to <a href="https://codegolf.stackexchange.com/users/92689/s%ca%a8%c9%a0%c9%a0an">@Sʨɠɠan</a></em></p>
<p>Prints the sequence indefinitely, starting at <span class="math-container">\$2\$</span> (as now allowed by the OP).</p>

<pre class="lang-javascript prettyprint-override"><code>for(n=2;;console.log(n.length))n=BigInt(n).toString(2)
</code></pre>
<p><a href="https://tio.run/##BcExDoAgDAXQ67SDDKzExc3ZExDEiiG/BhqvX9978pdnGe21BXpW90sHYY0pFcXUXkNXIYReIXYzY92a7DACB9PDRoNQZPcf" rel="nofollow noreferrer" title="JavaScript (Node.js) – Try It Online">Try it online!</a></p>


blocks|key|1401103|text|巩膜，21字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1401104|"2""2X>b+>S"itr"len"map|code-block|syntax|javascript|1401105|在这里试试！返回一个无限列表。|unstyled|1401106|为了测试目的(在本地运行时使用-i标志)：|style|CODE|1401107|;+10tk+>A
"2""2X>b+>S"itr"len"map|1401108|解释|1401109|修饰代码：|1401110|"2"+(+2X>b+>S+)+itr+\len+map|1401111|"2"+(+...+)+itr从2开始生成无限列表..。|unordered-list-item|1401112|2X>b到二进制|1401113|>S到字符串|1401114|1401115|\len+map获取每个元素的长度|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/molarmanful/sclin|1|https://replit.com/@molarmanful/try-sclin^0|0|2|0|0|0|0|6|1|0|F|2|0|0|0|0|0|0|F|1|0|4|1|0|2|1|0|0|8^^$0|@$1|2|3|4|5|6|7|1G|8|@]|9|@$A|1H|B|1I|1|1J]]|C|$]]|$1|D|3|E|5|F|7|1K|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1L|8|@]|9|@$A|1M|B|1N|1|1O]]|C|$]]|$1|L|3|M|5|K|7|1P|8|@$A|1Q|B|1R|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1S|8|@]|9|@]|C|$G|H]]|$1|R|3|S|5|6|7|1T|8|@]|9|@]|C|$]]|$1|T|3|U|5|K|7|1U|8|@]|9|@]|C|$]]|$1|V|3|W|5|F|7|1V|8|@]|9|@]|C|$G|H]]|$1|X|3|Y|5|Z|7|1W|8|@$A|1X|B|1Y|N|O]]|9|@]|C|$]]|$1|10|3|11|5|Z|7|1Z|8|@$A|20|B|21|N|O]]|9|@]|C|$]]|$1|12|3|13|5|Z|7|22|8|@$A|23|B|24|N|O]]|9|@]|C|$]]|$1|14|3|-4|5|K|7|25|8|@]|9|@]|C|$]]|$1|15|3|16|5|Z|7|26|8|@$A|27|B|28|N|O]]|9|@]|C|$]]]|17|$18|$5|19|1A|1B|C|$1C|1D]]|1E|$5|19|1A|1B|C|$1C|1F]]]]

<h1><a href="https://github.com/molarmanful/sclin" rel="nofollow noreferrer">sclin</a>, 21 bytes</h1>
<pre><code>&quot;2&quot;&quot;2X&gt;b &gt;S&quot;itr&quot;len&quot;map
</code></pre>
<p><a href="https://replit.com/@molarmanful/try-sclin" rel="nofollow noreferrer">Try it here!</a> Returns an infinite list.</p>
<p>For testing purposes (use <code>-i</code> flag if running locally):</p>
<pre><code>; 10tk &gt;A
&quot;2&quot;&quot;2X&gt;b &gt;S&quot;itr&quot;len&quot;map
</code></pre>
<h2>Explanation</h2>
<p>Prettified code:</p>
<pre><code>&quot;2&quot; ( 2X&gt;b &gt;S ) itr \len map
</code></pre>
<ul>
<li><code>&quot;2&quot; ( ... ) itr</code> generate infinite list starting from 2...
<ul>
<li><code>2X&gt;b</code> to binary</li>
<li><code>&gt;S</code> to string</li>
</ul>
</li>
<li><code>\len map</code> get lengths of each element</li>
</ul>


blocks|key|1392203|text|木炭，17字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1392204|≔2θＦＮ«⟦ＩＬθ⟧≔⍘Ｉθ²θ|code-block|syntax|javascript|1392205|在网上试试！链接是详细的代码版本。当我们输出以A242347开头的1时，这个版本也是如此。解释：|unstyled|style|CODE|1392206|≔2θ|1392207|从2开始。|1392208|ＦＮ«|1392209|重复n时间。|1392210|⟦ＩＬθ⟧|1392211|在自己的行上输出它的长度。|1392212|≔⍘Ｉθ²θ|1392213|将其转换为十进制，然后将其转换为二进制字符串。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/somebody1234/Charcoal|1|https://tio.run/##S85ILErOT8z5/9@xuDgzPU9DyUhJR6FQ05orLb9IQcMzr6C0xK80Nym1SENTU6GaizOgKDOvRCPaObG4RMMnNS@9JEOjUFMzFqiBE2qCU2JxanAJUFm6BlhVoaaOgpEmxNDa//9N/@uW5QAA^0|0|2|0|0|0|X|1|0|6|1|0|0|1|1|0|0|2|1|0|0|0|0^^$0|@$1|2|3|4|5|6|7|1C|8|@]|9|@$A|1D|B|1E|1|1F]]|C|$]]|$1|D|3|E|5|F|7|1G|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1H|8|@$A|1I|B|1J|L|M]]|9|@$A|1K|B|1L|1|1M]]|C|$]]|$1|N|3|O|5|F|7|1N|8|@]|9|@]|C|$G|H]]|$1|P|3|Q|5|K|7|1O|8|@$A|1P|B|1Q|L|M]]|9|@]|C|$]]|$1|R|3|S|5|F|7|1R|8|@]|9|@]|C|$G|H]]|$1|T|3|U|5|K|7|1S|8|@$A|1T|B|1U|L|M]]|9|@]|C|$]]|$1|V|3|W|5|F|7|1V|8|@]|9|@]|C|$G|H]]|$1|X|3|Y|5|K|7|1W|8|@]|9|@]|C|$]]|$1|Z|3|10|5|F|7|1X|8|@]|9|@]|C|$G|H]]|$1|11|3|12|5|K|7|1Y|8|@]|9|@]|C|$]]]|13|$14|$5|15|16|17|C|$18|19]]|1A|$5|15|16|17|C|$18|1B]]]]

<h1><a href="https://github.com/somebody1234/Charcoal" rel="nofollow noreferrer">Charcoal</a>, 17 bytes</h1>
<pre><code>≔2θＦＮ«⟦ＩＬθ⟧≔⍘Ｉθ²θ
</code></pre>
<p><a href="https://tio.run/##S85ILErOT8z5/9@xuDgzPU9DyUhJR6FQ05orLb9IQcMzr6C0xK80Nym1SENTU6GaizOgKDOvRCPaObG4RMMnNS@9JEOjUFMzFqiBE2qCU2JxanAJUFm6BlhVoaaOgpEmxNDa//9N/@uW5QAA" rel="nofollow noreferrer" title="Charcoal – Try It Online">Try it online!</a> Link is to verbose version of code. As we are outputting A242347, which starts with <code>1</code>, so does this version. Explanation:</p>
<pre><code>≔2θ
</code></pre>
<p>Start with <code>2</code>.</p>
<pre><code>ＦＮ«
</code></pre>
<p>Repeat <code>n</code> times.</p>
<pre><code>⟦ＩＬθ⟧
</code></pre>
<p>Output its length on its own line.</p>
<pre><code>≔⍘Ｉθ²θ
</code></pre>
<p>Cast it to decimal, then convert it to binary as a string.</p>


blocks|key|1392368|text|Pip，10字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1392369|Y2LaP#TB:y|code-block|syntax|javascript|1392370|在网上试试！|unstyled|1392371|在以2开头的序列中打印第一个a项，其中a是参数输入。|style|CODE|1392372|Y2LaP#TB:y++++++;+a+=+input
Y2++++++++++++++;+Set+y+=+2
++La++++++++++++;+Loop+the+following+code+"a"+times...
++++P#++++++++++;+Print+the+length+of...
++++++TB:y++++++;+y+treated+as+a+decimal+number+converted+to+a+binary+string
++++++++++++++++++and+set+y+to+that+value|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/dloscutoff/pip|1|https://dso.surge.sh/#@WyJwaXAiLCIiLCJZMkxhUCNUQjp5IiwiIiwiIiwiMTAiXQ==^0|0|3|0|0|0|0|6|1|0|E|1|J|1|0^^$0|@$1|2|3|4|5|6|7|10|8|@]|9|@$A|11|B|12|1|13]]|C|$]]|$1|D|3|E|5|F|7|14|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|15|8|@]|9|@$A|16|B|17|1|18]]|C|$]]|$1|L|3|M|5|K|7|19|8|@$A|1A|B|1B|N|O]|$A|1C|B|1D|N|O]]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1E|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]]]

<h1><a href="https://github.com/dloscutoff/pip" rel="nofollow noreferrer">Pip</a>, 10 bytes</h1>
<pre><code>Y2LaP#TB:y
</code></pre>
<p><a href="https://dso.surge.sh/#@WyJwaXAiLCIiLCJZMkxhUCNUQjp5IiwiIiwiIiwiMTAiXQ==" rel="nofollow noreferrer">Try It Online!</a></p>
<p>Prints the first <code>a</code> terms in the sequence starting with 2, where <code>a</code> is the argument input.</p>
<pre><code>Y2LaP#TB:y      ; a = input
Y2              ; Set y = 2
  La            ; Loop the following code &quot;a&quot; times...
    P#          ; Print the length of...
      TB:y      ; y treated as a decimal number converted to a binary string
                  and set y to that value
</code></pre>


blocks|key|1392878|text|05AB1E，6+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1392879|从2开始的无限序列：|unstyled|style|CODE|1392880|Tλb}€g|code-block|syntax|javascript|1392881|在网上试试。|1392882|可以是从1开始的无限序列，方法是将T替换为2：2λb}€g+-+在网上试试。|1392883|输出的n%5E{th}项为6+字节数以及2λèb}g+(在网上试试)或2IFb}g+(在网上试试)；|1392884|1392885|输出的第一个n值为7+字节数，带有2λ£b}€g+(在网上试试)或2IFbDg,+(在网上试试)。|1392886|Explanation:|1392887|+λ++++++#+Start+a+recursive+environment,
++++++++#+to+output+the+infinite+sequence
T+++++++#+Starting+at+a(0)=10
++++++++#+Where+every+following+a(n)+is+calculated+as:
++++++++#++(implicitly+push+the+previous+term+a(n-1))
++b+++++#++Convert+it+from+a+base-10+integer+to+a+binary+string
+++}€+++#+After+we+have+the+infinite+sequence:+map+over+each+binary+string:
+++++g++#++Pop+and+push+its+length
++++++++#+(after+which+the+infinite+sequence+is+output+implicitly)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/Adriandmen/05AB1E/wiki/Commands|1|https://github.com/Adriandmen/05AB1E/wiki/Codepage|2|https://tio.run/##yy9OTMpM/f8/5NzupNpHTWvS//8HAA|3|https://tio.run/##yy9OTMpM/f/f6NzupNpHTWvS//8HAA|4|INLINETEX|IMMUTABLE|teX|n%5E{th}|5|6|https://tio.run/##yy9OTMpM/f/f6NzuwyuSatP//zcFAA|7|https://tio.run/##yy9OTMpM/f/fyNMtqTb9/38DAA|8|n|9|10|https://tio.run/##yy9OTMpM/f/f6NzuQ4uTah81rUn//98UAA|11|https://tio.run/##yy9OTMpM/f/fyNMtySVd5/9/UwA^0|0|6|0|9|3|1|0|1|1|0|0|0|6|2|0|4|1|H|1|L|1|N|6|W|5|3|0|3|6|I|6|X|6|3|6|4|D|3|5|Q|5|6|15|5|7|0|0|6|1|H|7|X|7|6|1|8|B|3|9|Q|5|A|16|5|B|0|0^^$0|@$1|2|3|4|5|6|7|1U|8|@]|9|@$A|1V|B|1W|1|1X]|$A|1Y|B|1Z|1|20]]|C|$]]|$1|D|3|E|5|F|7|21|8|@$A|22|B|23|G|H]]|9|@]|C|$]]|$1|I|3|J|5|K|7|24|8|@]|9|@]|C|$L|M]]|$1|N|3|O|5|F|7|25|8|@]|9|@$A|26|B|27|1|28]]|C|$]]|$1|P|3|Q|5|F|7|29|8|@$A|2A|B|2B|G|H]|$A|2C|B|2D|G|H]|$A|2E|B|2F|G|H]|$A|2G|B|2H|G|H]]|9|@$A|2I|B|2J|1|2K]]|C|$]]|$1|R|3|S|5|F|7|2L|8|@$A|2M|B|2N|G|H]|$A|2O|B|2P|G|H]|$A|2Q|B|2R|G|H]]|9|@$A|2S|B|2T|1|2U]|$A|2V|B|2W|1|2X]|$A|2Y|B|2Z|1|30]|$A|31|B|32|1|33]]|C|$]]|$1|T|3|-4|5|F|7|34|8|@]|9|@]|C|$]]|$1|U|3|V|5|F|7|35|8|@$A|36|B|37|G|H]|$A|38|B|39|G|H]|$A|3A|B|3B|G|H]]|9|@$A|3C|B|3D|1|3E]|$A|3F|B|3G|1|3H]|$A|3I|B|3J|1|3K]|$A|3L|B|3M|1|3N]]|C|$]]|$1|W|3|X|5|6|7|3O|8|@]|9|@]|C|$]]|$1|Y|3|Z|5|K|7|3P|8|@]|9|@]|C|$L|M]]]|10|$11|$5|12|13|14|C|$15|16]]|17|$5|12|13|14|C|$15|18]]|19|$5|12|13|14|C|$15|1A]]|1B|$5|12|13|14|C|$15|1C]]|1D|$5|1E|13|1F|C|$1G|1H]]|1I|$5|12|13|14|C|$15|18]]|1J|$5|12|13|14|C|$15|1K]]|1L|$5|12|13|14|C|$15|1M]]|1N|$5|1E|13|1F|C|$1G|1O]]|1P|$5|12|13|14|C|$15|18]]|1Q|$5|12|13|14|C|$15|1R]]|1S|$5|12|13|14|C|$15|1T]]]]

<h1><a href="https://github.com/Adriandmen/05AB1E/wiki/Commands" rel="nofollow noreferrer">05AB1E</a>, 6 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a></h1>
<p>Infinite sequence starting at <code>2</code>:</p>
<pre><code>Tλb}€g
</code></pre>
<p><a href="https://tio.run/##yy9OTMpM/f8/5NzupNpHTWvS//8HAA" rel="nofollow noreferrer">Try it online.</a></p>
<p>Could be the infinite sequence starting at <code>1</code> by replacing <code>T</code> with <code>2</code>: <code>2λb}€g</code> - <a href="https://tio.run/##yy9OTMpM/f/f6NzupNpHTWvS//8HAA" rel="nofollow noreferrer">try it online</a>.</p>
<p>Outputting the <span class="math-container">\$n^{th}\$</span> term is 6 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a> as well with either <code>2λèb}g</code> (<a href="https://tio.run/##yy9OTMpM/f/f6NzuwyuSatP//zcFAA" rel="nofollow noreferrer">try it online</a>) or <code>2IFb}g</code> (<a href="https://tio.run/##yy9OTMpM/f/fyNMtqTb9/38DAA" rel="nofollow noreferrer">try it online</a>);<br />
and outputting the first <span class="math-container">\$n\$</span> values is 7 <a href="https://github.com/Adriandmen/05AB1E/wiki/Codepage" rel="nofollow noreferrer">bytes</a> with either <code>2λ£b}€g</code> (<a href="https://tio.run/##yy9OTMpM/f/f6NzuQ4uTah81rUn//98UAA" rel="nofollow noreferrer">try it online</a>) or <code>2IFbDg,</code> (<a href="https://tio.run/##yy9OTMpM/f/fyNMtySVd5/9/UwA" rel="nofollow noreferrer">try it online</a>).</p>
<p><strong>Explanation:</strong></p>

<pre class="lang-python prettyprint-override"><code> λ      # Start a recursive environment,
        # to output the infinite sequence
T       # Starting at a(0)=10
        # Where every following a(n) is calculated as:
        #  (implicitly push the previous term a(n-1))
  b     #  Convert it from a base-10 integer to a binary string
   }€   # After we have the infinite sequence: map over each binary string:
     g  #  Pop and push its length
        # (after which the infinite sequence is output implicitly)
</code></pre>


blocks|key|1393012|text|MathGolf，7+字节数|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1393013|2æhpià∟|code-block|syntax|javascript|1393014|从1开始打印无限序列。|unstyled|style|CODE|1393015|在网上试试。|1393016|输出第一个n术语将是8+字节数，而不是：|1393017|2kæhpià;|1393018|1393019|Explanation:|1393020|2++++++++#+Push+a+2
++++++∟++#+Do-while+true+(without+popping),
+æ+++++++#+using+4+characters+as+inner+code-block:
++h++++++#++Push+the+length+(without+popping)
+++p+++++#++Pop+and+print+it+with+trailing+newline
++++i++++#++Convert+the+binary-string+to+a+base-10+integer
+++++à+++#++Convert+that+integer+to+a+binary-string|1393021|第一个n术语的程序非常相似，只是k推送输入整数；æ充当循环多次而不是do-while循环；;在循环之后丢弃最后的二进制字符串，否则就会被隐式输出。|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/maxbergmark/mathgolf/blob/master/math_golf.txt|1|https://github.com/maxbergmark/mathgolf/blob/master/code_page.py|2|https://tio.run/##y00syUjPz0n7/9/o8LKMgszDCx51zP//HwA|3|INLINETEX|IMMUTABLE|teX|n|4|5|https://tio.run/##y00syUjPz0n7/98o@/CyjILMwwusgWwuUy5DAwA|6^0|0|8|0|B|3|1|0|0|1|1|0|0|6|2|0|5|1|5|1|3|C|3|4|0|0|0|6|5|0|0|0|3|1|G|1|O|1|19|1|3|1|6^^$0|@$1|2|3|4|5|6|7|1K|8|@]|9|@$A|1L|B|1M|1|1N]|$A|1O|B|1P|1|1Q]]|C|$]]|$1|D|3|E|5|F|7|1R|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|1S|8|@$A|1T|B|1U|L|M]]|9|@]|C|$]]|$1|N|3|O|5|K|7|1V|8|@]|9|@$A|1W|B|1X|1|1Y]]|C|$]]|$1|P|3|Q|5|K|7|1Z|8|@$A|20|B|21|L|M]]|9|@$A|22|B|23|1|24]|$A|25|B|26|1|27]]|C|$]]|$1|R|3|S|5|F|7|28|8|@]|9|@]|C|$G|H]]|$1|T|3|O|5|K|7|29|8|@]|9|@$A|2A|B|2B|1|2C]]|C|$]]|$1|U|3|V|5|6|7|2D|8|@]|9|@]|C|$]]|$1|W|3|X|5|F|7|2E|8|@]|9|@]|C|$G|H]]|$1|Y|3|Z|5|K|7|2F|8|@$A|2G|B|2H|L|M]|$A|2I|B|2J|L|M]|$A|2K|B|2L|L|M]|$A|2M|B|2N|L|M]]|9|@$A|2O|B|2P|1|2Q]]|C|$]]]|10|$11|$5|12|13|14|C|$15|16]]|17|$5|12|13|14|C|$15|18]]|19|$5|12|13|14|C|$15|1A]]|1B|$5|1C|13|1D|C|$1E|1F]]|1G|$5|12|13|14|C|$15|18]]|1H|$5|12|13|14|C|$15|1I]]|1J|$5|1C|13|1D|C|$1E|1F]]]]

<h1><a href="https://github.com/maxbergmark/mathgolf/blob/master/math_golf.txt" rel="nofollow noreferrer">MathGolf</a>, 7 <a href="https://github.com/maxbergmark/mathgolf/blob/master/code_page.py" rel="nofollow noreferrer">bytes</a></h1>
<pre><code>2æhpià∟
</code></pre>
<p>Prints the infinite sequence, starting from <code>1</code>.</p>
<p><a href="https://tio.run/##y00syUjPz0n7/9/o8LKMgszDCx51zP//HwA" rel="nofollow noreferrer">Try it online.</a></p>
<p>Outputting the first <span class="math-container">\$n\$</span> terms would be 8 <a href="https://github.com/maxbergmark/mathgolf/blob/master/code_page.py" rel="nofollow noreferrer">bytes</a> instead:</p>
<pre><code>2kæhpià;
</code></pre>
<p><a href="https://tio.run/##y00syUjPz0n7/98o@/CyjILMwwusgWwuUy5DAwA" rel="nofollow noreferrer">Try it online.</a></p>
<p><strong>Explanation:</strong></p>

<pre class="lang-python prettyprint-override"><code>2        # Push a 2
      ∟  # Do-while true (without popping),
 æ       # using 4 characters as inner code-block:
  h      #  Push the length (without popping)
   p     #  Pop and print it with trailing newline
    i    #  Convert the binary-string to a base-10 integer
     à   #  Convert that integer to a binary-string
</code></pre>
<p>The program for the first <span class="math-container">\$n\$</span> terms is pretty similar, except that <code>k</code> pushes the input-integer; <code>æ</code> acts as a loop that many times instead of the do-while loop; and <code>;</code> discards the final binary-string after the loop, which would otherwise have been output implicitly.</p>


blocks|key|1402318|text|><>，40字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1402319|2:2(?v:2%25$2,:1%25-!
?v00.>lnao>l1)
.>a*%2Ba1|code-block|syntax|javascript|1402320|在网上试试|unstyled|1402321|“无限序列”人满为患的第七位。|entityMap|0|LINK|mutability|MUTABLE|url|https://esolangs.org/wiki/Fish|1|https://tio.run/#%2523S8sszvj/38jKSMO@zMpIVcVIx8pQVVeRy77MwEDPLicvMd8ux1CTS88uUUs70fD/fwA^0|0|3|0|0|0|0|5|1|0^^$0|@$1|2|3|4|5|6|7|W|8|@]|9|@$A|X|B|Y|1|Z]]|C|$]]|$1|D|3|E|5|F|7|10|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|11|8|@]|9|@$A|12|B|13|1|14]]|C|$]]|$1|L|3|M|5|K|7|15|8|@]|9|@]|C|$]]]|N|$O|$5|P|Q|R|C|$S|T]]|U|$5|P|Q|R|C|$S|V]]]]

<h1><a href="https://esolangs.org/wiki/Fish" rel="nofollow noreferrer">&gt;&lt;&gt;</a>, 40 bytes</h1>
<pre><code>2:2(?v:2%$2,:1%-!
?v00.&gt;lnao&gt;l1)
.&gt;a*+a1
</code></pre>
<p><a href="https://tio.run/#%23S8sszvj/38jKSMO@zMpIVcVIx8pQVVeRy77MwEDPLicvMd8ux1CTS88uUUs70fD/fwA" rel="nofollow noreferrer">Try it online</a></p>
<p>&quot;Infinte sequence&quot;. Overflows at the 7th number.</p>


blocks|key|1402253|text|盖亚，11字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1402254|)2¤U⟪¤bd⟫⊢l|code-block|syntax|javascript|1402255|在网上试试！或试试看！|unstyled|1402256|一种果冻答案的副本，但在盖亚。我想>=+12的时间到了。|1402257|解释了|1402258|)2¤U⟪¤bd⟫⊢l
)++++++++++++#+Increment+the+input
+2¤++++++++++#+Push+2+"under"+the+incremented+input+by+pushing+2+and+then+swapping
+++U+++++++++#+Push+a+range+[2,+input+%2B+1]+to+the+stack
++++⟪+++⟫⊢+++#+Reduce+that+list+by:
+++++¤b++++++#+++Converting+the+last+item+to+binary
+++++++d+++++#+++And+then+to+decimal
+++++++++l+++#+Get+the+length+of+the+result|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/splcurran/Gaia|1|https://tio.run/##AR0A4v9nYWlh//8pMsKkVeKfqsKkYmTin6viiqJs//8xMA|2|https://tio.run/##AUwAs/9nYWlh//8pMsKkVeKfqsKkYmTin6viiqJs/zpw4oCcIC0@IOKAnXDihpFxClsxIDIgMyA0IDUgNiA3IDggOSAxMCAyMF0g4oaRwqb/^0|0|2|0|0|0|0|6|1|7|4|2|0|0|0^^$0|@$1|2|3|4|5|6|7|12|8|@]|9|@$A|13|B|14|1|15]]|C|$]]|$1|D|3|E|5|F|7|16|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|17|8|@]|9|@$A|18|B|19|1|1A]|$A|1B|B|1C|1|1D]]|C|$]]|$1|L|3|M|5|K|7|1E|8|@]|9|@]|C|$]]|$1|N|3|O|5|6|7|1F|8|@]|9|@]|C|$]]|$1|P|3|Q|5|F|7|1G|8|@]|9|@]|C|$G|H]]]|R|$S|$5|T|U|V|C|$W|X]]|Y|$5|T|U|V|C|$W|Z]]|10|$5|T|U|V|C|$W|11]]]]

<h1><a href="https://github.com/splcurran/Gaia" rel="nofollow noreferrer">Gaia</a>, 11 bytes</h1>
<pre><code>)2¤U⟪¤bd⟫⊢l
</code></pre>
<p><a href="https://tio.run/##AR0A4v9nYWlh//8pMsKkVeKfqsKkYmTin6viiqJs//8xMA" rel="nofollow noreferrer" title="Gaia – Try It Online">Try it online!</a> or <a href="https://tio.run/##AUwAs/9nYWlh//8pMsKkVeKfqsKkYmTin6viiqJs/zpw4oCcIC0@IOKAnXDihpFxClsxIDIgMyA0IDUgNiA3IDggOSAxMCAyMF0g4oaRwqb/" rel="nofollow noreferrer" title="Gaia – Try It Online">Try a test suite!</a></p>
<p>A sort of copy of the Jelly answer but in Gaia. Times out for &gt;= 12 I think.</p>
<h2>Explained</h2>
<pre><code>)2¤U⟪¤bd⟫⊢l
)            # Increment the input
 2¤          # Push 2 &quot;under&quot; the incremented input by pushing 2 and then swapping
   U         # Push a range [2, input + 1] to the stack
    ⟪   ⟫⊢   # Reduce that list by:
     ¤b      #   Converting the last item to binary
       d     #   And then to decimal
         l   # Get the length of the result
</code></pre>


blocks|key|1402411|text|Pyt，8字节|type|header-two|depth|inlineStyleRanges|entityRanges|offset|length|data|1402412|2`ĐąŁƥɓł|code-block|syntax|javascript|1402413|在网上试试！|unstyled|1402414|无限期的指纹。|1402415|2+++++++++++push+2
+`+++++ł++++do...+while+top+of+stack+is+truthy
++Đ+++++++++Đuplicate
+++ą++++++++convert+to+ąrray+of+digits
++++Łƥ++++++ƥrint+Łength
++++++ɓ+++++convert+to+ɓinary+string+(implicitly+treats+output+as+decimal+number)|entityMap|0|LINK|mutability|MUTABLE|url|https://github.com/mudkip201/pyt|1|https://tio.run/##K6gs@f/fKOHIhCOtRxuPLT05@WjT//8A^0|0|3|0|0|0|0|6|1|0|0^^$0|@$1|2|3|4|5|6|7|Y|8|@]|9|@$A|Z|B|10|1|11]]|C|$]]|$1|D|3|E|5|F|7|12|8|@]|9|@]|C|$G|H]]|$1|I|3|J|5|K|7|13|8|@]|9|@$A|14|B|15|1|16]]|C|$]]|$1|L|3|M|5|K|7|17|8|@]|9|@]|C|$]]|$1|N|3|O|5|F|7|18|8|@]|9|@]|C|$G|H]]]|P|$Q|$5|R|S|T|C|$U|V]]|W|$5|R|S|T|C|$U|X]]]]

<h1><a href="https://github.com/mudkip201/pyt" rel="nofollow noreferrer">Pyt</a>, 8 bytes</h1>
<pre><code>2`ĐąŁƥɓł
</code></pre>
<p><a href="https://tio.run/##K6gs@f/fKOHIhCOtRxuPLT05@WjT//8A" rel="nofollow noreferrer" title="Pyt – Try It Online">Try it online!</a></p>
<p>Prints indefinitely.</p>
<pre><code>2           push 2
 `     ł    do... while top of stack is truthy
  Đ         Đuplicate
   ą        convert to ąrray of digits
    Łƥ      ƥrint Łength
      ɓ     convert to ɓinary string (implicitly treats output as decimal number)
</code></pre>


<p>Computers like binary. Humans like base 10. Assuming users are humans, why not find the best of both worlds?
Your task is to find the first <code>n</code> terms in the sequence <a href="https://oeis.org/A008559" rel="noreferrer">A008559</a> where each term is the binary representation of the previous number interpreted as a base 10 number.</p>
<h2>Input</h2>
<p>An integer greater than 0. Note that the first value of A008559 is 2.</p>
<h2>Output</h2>
<p>Just to make it a little more readable, the output should be the number of digits in the Nth term of A008559, which is <a href="https://oeis.org/A242347" rel="noreferrer">A242347</a>.
Invalid inputs can output whatever, standard <a href="/questions/tagged/sequence" class="post-tag" title="show questions tagged &#39;sequence&#39;" aria-label="show questions tagged &#39;sequence&#39;" rel="tag" aria-labelledby="sequence-container">sequence</a> rules apply.</p>
<h2>Scoring</h2>
<p>This is <a href="/questions/tagged/code-golf" class="post-tag" title="show questions tagged &#39;code-golf&#39;" aria-label="show questions tagged &#39;code-golf&#39;" rel="tag" aria-labelledby="code-golf-container">code-golf</a> so shortest bytecount wins, no standard loopholes etc...</p>
<h2>Test Cases</h2>
<pre><code>2 -&gt; [1,2]
5 -&gt; [1,2,4,10,31]
10 -&gt; [1,2,4,10,31,100,330,1093,3628,12049]
20 -&gt; [1,2,4,10,31,100,330,1093,3628,12049,40023,132951,441651,1467130,4873698,16190071,53782249,178660761,593498199,1971558339]
</code></pre>


Length of Binary as Base 10 [OEIS A242347]

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

教程

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云智能顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云AI代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

功能1上新10个字符

功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符功能2描述100个字符。

功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符功能2上新100个字符。

功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符功能5描述100个字符

功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符功能5上新100个字符

功能4上新

文章&问答评论现已支持表情

全新交互，全新视觉，新增快捷键、悬浮工具栏、高亮块等功能并同时优化现有功能，全面提升创作效率和体验

社区富文本编辑器全新改版！诚邀体验～ 

精选全网热门MCP server，让你的AI更好用 🚀

💥开发者 MCP广场重磅上线！

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

聚焦“写作效率、视觉美观与运行性能”三方面进行全面升级，为您提供更高效、稳定的创作环境

社区富文本&Markdown编辑器全新改版上线，欢迎大家体验!

诚挚邀请您参与本次调研，分享您的真实使用感受与建议。您的反馈至关重要，感谢您的支持与参与！

社区新版编辑器体验调研

电脑就像二进制。人类喜欢基地10。假设用户是人类，为什么不找出这两个世界中最好的呢？您的任务是在序列n中找到第一个A008559项，其中每个项都是前一个数字的二进制表示，解释为一个基数10。输入大于0的整数。注意，A008559的第一个值是2。输出为了使其更具可读性，输出应该是A008559第N项中的数字数，即A242347。无效的输入可以输出任何，标准的序列规则。评分这是密码-高尔夫，所以最短的

问二进制长度为10 [OEIS A242347]
EN

输入

输出

评分

测试用例

回答 18

Code Golf用户

图2，8\log_{256}(96)\approx 6.585字节

Code Golf用户

K (ngn/k)，14字节

Code Golf用户

因子，35字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问二进制长度为10 [OEIS A242347]EN

输入

输出

评分

测试用例

回答 18

Code Golf用户

图2，8\log_{256}(96)\approx 6.585字节

Code Golf用户

K (ngn/k)，14字节

Code Golf用户

因子，35字节

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问二进制长度为10 [OEIS A242347]
EN