Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
(Python)
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
approved
editing
_Labos E. (labos(AT)ana.sote.hu), Elemer_, Jul 02 2001
Edited, corrected and extended by _Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), _, Sep 24 2007
<a href="/Sindx_index/Br.html#B_2">Index entries for B_2 sequences</a>
Klaus Brockhaus, <a href="/A062295/b062295.txt">Table of n, a(n) for n = 1..4944</a>
<a href="/Sindx_Br.html#B_2">Index entries for B_2 sequences</a>
nonn,new
nonn
K. Klaus Brockhaus, <a href="b062295.txt">Table of n, a(n) for n = 1..4944</a>
nonn,new
nonn
K. Brockhaus, <a href="http://www.research.att.com/~njas/sequences/b062295.txt">Table of n, a(n) for n = 1..4944</a>
<a href="http://www.research.att.com/~njas/sequences/Sindx_Br.html#B_2">Index entries for B_2 sequences</a>
nonn,new
nonn
E. W. Eric Weisstein, 's World of Mathematics, <a href="http://mathworld.wolfram.com/B2-Sequence.html">B2-Sequence</a>
nonn,new
nonn