|
|
|
|
|
|
|
|
|
#45 by Michael S. Branicky at Wed Aug 21 06:33:12 EDT 2024
|
|
|
|
|
|
|
|
#44 by Michael S. Branicky at Wed Aug 21 06:33:10 EDT 2024
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#37 by Michael S. Branicky at Wed Aug 21 06:31:39 EDT 2024
|
|
|
|
|
|
|
|
#36 by Michael S. Branicky at Wed Aug 21 06:31:37 EDT 2024
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#12 by Michael S. Branicky at Tue Aug 20 19:51:33 EDT 2024
|
|
|
|
|
|
Discussion
|
| Wed Aug 21
| 13:17
| Michel Marcus: needs more terms
|
|
|
|
|
|
|
#11 by Michael S. Branicky at Tue Aug 20 19:51:30 EDT 2024
|
|
| PROG
|
print(list(islice(agen(), 5065))) # Michael S. Branicky, Aug 20 2024
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#10 by Michael S. Branicky at Tue Aug 20 19:50:50 EDT 2024
|
|
|
|
|
|
|
|
#9 by Michael S. Branicky at Tue Aug 20 19:50:29 EDT 2024
|
|
| PROG
|
(Python)
from sympy import divisors
from itertools import count, islice
def agen(): # generator of terms
adict, n = dict(), 2
for k in count(2):
d = divisors(k)
if len(d) < n-1: continue
dset, s = set(d), 0
for i, di in enumerate(d, 1):
s += di
if i >= n and i not in adict and s in dset:
adict[i] = d.index(s) + 1
while n in adict: yield adict[n]; n += 1
print(list(islice(agen(), 50))) # Michael S. Branicky, Aug 20 2024
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
Discussion
|
| Tue Aug 20
| 19:50
| Michael S. Branicky: can fit 20 more terms. insert 1 here too?
|
|
|
|
|
|
|
|
|
|
|
|
|
#18 by Michael S. Branicky at Tue Aug 20 19:43:04 EDT 2024
|
|
|
|
|
|
|
|
#17 by Michael S. Branicky at Tue Aug 20 19:43:00 EDT 2024
|
|
|
|
|
|
|
