|
|
|
|
| A014486
|
|
List of totally balanced sequences of 2n binary digits written in base 10. Binary expansion of each term contains n 0's and n 1's and reading from left to right (the most significant to the least significant bit), the number of 0's never exceeds the number of 1's.
(history;
published version)
|
|
|
|
|
#224 by Michel Marcus at Sun Aug 04 16:39:46 EDT 2024
|
|
|
|
|
|
|
|
#223 by Andrew Howroyd at Sun Aug 04 16:31:11 EDT 2024
|
|
|
|
|
|
|
|
#222 by Jason Yuen at Sun Aug 04 16:11:03 EDT 2024
|
|
|
|
|
|
|
|
#221 by Jason Yuen at Sun Aug 04 16:10:52 EDT 2024
|
|
| COMMENTS
|
Is Sum_{k=1..n} a(k)) / ) / n^(5/2) bounded? - Benoit Cloitre, Aug 18 2002
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#220 by Michael De Vlieger at Thu May 30 06:53:40 EDT 2024
|
|
|
|
|
|
|
|
#219 by Kevin Ryde at Thu May 30 05:02:43 EDT 2024
|
|
|
|
|
|
|
|
#218 by Ruud H.G. van Tol at Thu May 16 07:23:33 EDT 2024
|
|
|
|
|
|
|
|
#217 by Ruud H.G. van Tol at Thu May 16 07:22:31 EDT 2024
|
|
| PROG
|
(PARI) a_rows(N) = my(a=Vec([[0]], N)); for(r=1, N-1, my(b=a[r], c=List()); foreach(b, t, my(v=if(t, valuation(t, 2), 0)-1); )); for(i=0, v, listput(~c, (t<<2)+(2<<i))); listput(~c, (t<<2)+(4<<v))); )))); a[r+1]=Vec(c)); a; \\ Ruud H.G. van Tol, May 16 2024
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Thu May 16
| 07:23
| Ruud H.G. van Tol: Improved the code again, and only now it really looks clean.
|
|
|
|
|
|
|
#216 by Ruud H.G. van Tol at Thu May 16 05:48:33 EDT 2024
|
|
|
|
|
|
|
|
#215 by Ruud H.G. van Tol at Thu May 16 05:48:26 EDT 2024
|
|
| PROG
|
(PARI) a_rows(N) = my(a=Vec([[0]], N)); for(r=21, N-1, my(b=a[r], c=List()); foreach(b, t, my(v=if(t, valuation(t, 2), 0)-1); for(i=0, v, listput(~c, (t<<2)+(2<<i))); listput(~c, (t<<2)+(4<<v))); a[r+1]=Vec(c)); a; \\ Ruud H.G. van Tol, May 16 2024
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
