A133745 Numbers n such that A133744(n) = 0.
1, 2, 3, 4, 5, 6, 10, 16, 23, 52, 71, 137, 224, 260, 361, 668, 695, 699, 1518, 1775, 1776, 3285, 7030, 36261
Offset: 1
Extensions
a(23)-a(24) from Chai Wah Wu, Sep 11 2023
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.
36 is in the sequence since the pairwise sums of {1, 4, 9, 16, 25, 36} are all distinct: 2, 5, 8, 10, 13, 17, 18, 20, 25, 26, 29, 32, 34, 37, 40, 41, 45, 50, 52, 61, 72.
49 is not in the sequence since 1 + 49 = 25 + 25.
from itertools import count, islice def A062295_gen(): # generator of terms aset1, aset2, alist = set(), set(), [] for k in (n**2 for n in count(1)): bset2 = {k<<1} if (k<<1) not in aset2: for d in aset1: if (m:=d+k) in aset2: break bset2.add(m) else: yield k alist.append(k) aset1.add(k) aset2 |= bset2 A062295_list = list(islice(A062295_gen(),30)) # Chai Wah Wu, Sep 05 2023
49 is in the sequence since the pairwise sums of distinct elements of {1, 4, 9, 16, 25, 36, 49} are all distinct: 5, 10, 13, 17, 20, 25, 26, 29, 34, 37, 40, 41, 45, 50, 52, 53, 58, 61, 65, 74, 85.
64 is not in the sequence since 1 + 64 = 16 + 49.
from itertools import count, islice def A133743_gen(): # generator of terms aset2, alist = set(), [] for k in map(lambda x:x**2, count(1)): bset2 = set() for a in alist: if (b:=a+k) in aset2: break bset2.add(b) else: yield k alist.append(k) aset2.update(bset2) A133743_list = list(islice(A133743_gen(),30)) # Chai Wah Wu, Sep 11 2023
Comments