This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A076877 #15 Apr 07 2021 04:47:51 %S A076877 3,5,5,9,9,9,9,17,17,17,17,17,17,17,17,33,33,33,33,33,33,33,33,33,33, %T A076877 33,33,33,33,33,33,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65, %U A076877 65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,129,129,129,129,129,129 %N A076877 a(n) = A020330(n) / n. %H A076877 Amiram Eldar, <a href="/A076877/b076877.txt">Table of n, a(n) for n = 1..10000</a> %H A076877 Ralf Stephan, <a href="/somedcgf.html">Some divide-and-conquer sequences with (relatively) simple ordinary generating functions</a>, 2004. %H A076877 Ralf Stephan, <a href="/A079944/a079944.ps">Table of generating functions</a>. %F A076877 a(n) = 1 + 2^(1 + Log2(n)), with Log2 = A000523. %F A076877 a(n) = 1 + 2*A053644(n). %F A076877 a(n) = 1 + A062383(n). %e A076877 12 -> '1100' -> '1100'1100' = '11001100' -> 204 = A020330(12): a(12) = A020330(12)/12 = 204/12 = 17. %t A076877 a[n_] := 1 + 2^Floor[Log2[n] + 1]; Array[a, 50] (* _Amiram Eldar_, Apr 07 2021 *) %Y A076877 Cf. A000523, A020330, A053644, A062383. %K A076877 nonn %O A076877 1,1 %A A076877 _Reinhard Zumkeller_, Nov 25 2002