|
|
|
|
|
|
|
|
|
#16 by Joerg Arndt at Thu Oct 06 04:30:29 EDT 2022
|
|
|
|
|
|
|
|
#15 by Michel Marcus at Thu Oct 06 02:33:39 EDT 2022
|
|
|
|
|
|
|
|
#14 by Michael S. Branicky at Wed Oct 05 16:43:51 EDT 2022
|
|
|
|
|
|
Discussion
|
| Wed Oct 05
| 16:44
| Michael S. Branicky: just a program. confirms entire b-file.
|
|
|
|
|
|
|
#13 by Michael S. Branicky at Wed Oct 05 16:43:48 EDT 2022
|
|
| PROG
|
(Python)
from itertools import count, islice
from collections import Counter
def agen():
yield 1
num, alst, inventory = 0, [0, 0], Counter([0, 0])
for n in count(2):
c = [inventory[num], num]
num = 0 if c[0] == 0 else num + 1
if c[0] == 0: yield n
inventory.update(c)
print(list(islice(agen(), 51))) # Michael S. Branicky, Oct 05 2022
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#12 by Michael De Vlieger at Tue Sep 27 12:43:46 EDT 2022
|
|
|
|
|
|
|
|
#11 by Michel Marcus at Tue Sep 27 12:43:05 EDT 2022
|
|
|
|
|
|
|
|
#10 by Michael De Vlieger at Mon Sep 26 21:17:34 EDT 2022
|
|
|
|
|
|
|
|
#9 by Michael De Vlieger at Mon Sep 26 21:16:39 EDT 2022
|
|
| LINKS
|
Michael De Vlieger, <a href="/A357370/b357370.txt">Table of n, a(n) for n = 1..10000</a>
|
|
| MATHEMATICA
|
nn = 51; c[_] = 0; i = 1; Reap[Do[k = 0; While[c[k] > 0, Set[{a[i], a[i + 1]}, {m, c[k], k}]; ]]; c[a[i]]++; m]++; c[a[i + 1]]++; k]++; i += 2; k++]; Set[{a[i], a[i + 1]}, {m, c[k], k}]; ]]; c[a[i]]++; m]++; c[a[i + 1]]++; k]++; Sow[(i + 1)/2]; i += 2, {n, nn}]][[-}] ][[-1, -1]]
|
|
| STATUS
|
approved
editing
|
|
|
|
|
Discussion
|
| Mon Sep 26
| 21:17
| Michael De Vlieger: b-file, program uses less memory.
|
|
|
|
|
|
|
#8 by N. J. A. Sloane at Mon Sep 26 20:13:50 EDT 2022
|
|
|
|
|
|
|
|
#7 by N. J. A. Sloane at Mon Sep 26 20:13:17 EDT 2022
|
|
| NAME
|
Positions of 0's in A355917.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Mon Sep 26
| 20:13
| N. J. A. Sloane: I think 0's rather than 0 (better grammar)
|
|
|
|
|
|
