OFFSET
1,1
COMMENTS
The number of bits in each term is 0 or -1 (mod 4). - Ruud H.G. van Tol, Feb 28 2026
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = A392236(2*n)/2.
MATHEMATICA
A392980Q[k_] := Total[#*Range[Length[#], 1, -1]] == 0 & [2*IntegerDigits[k, 2] - 1];
Select[Range[2500], A392980Q]
PROG
(PARI) lista(len) = len<1 && return([]); my(r=List(), b); for(i=1, oo, #(b=binary(i))%4%3 && (i+=2^(#b-1)-1) && next; if(!(2*b*-[-#b..-1]~ - binomial(#b+1, 2)), listput(~r, i); #r<len||break)); Vec(r); \\ Ruud H.G. van Tol, Mar 02 2026
(Python)
from itertools import count, islice
def A392980_gen(startvalue=1): # generator of terms >= startvalue
return filter(lambda n: not (m:=n.bit_length()+1)&2 and (sum(i if j == '1' else 0 for i, j in enumerate(bin(n)[:1:-1], 1))<<2)==m*(m-1), count(max(startvalue, 1)))
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Paolo Xausa, Feb 26 2026
STATUS
approved
