OFFSET
1,3
LINKS
Dumitru Damian, Table of n, a(n) for n = 1..10000
PROG
(Python)
def isa(n): return n.bit_count()==((n*(n+1))>>1).bit_count()
print(list(n for n in range(10**3) if isa(n))) # Dumitru Damian, Mar 04 2023
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Alex Ratushnyak, Oct 24 2013
STATUS
approved