OFFSET
1,1
PROG
(SageMath)
def divsign(s, k):
if not k.divides(s): return 0
return (-1)^(s//k)*k
def A(n):
s = n + 1
for k in srange(n, 1, -1):
s -= divsign(s, k)
return s
# Use with caution: search range must be adjusted as necessary!
def A064627List(size):
return sorted(Set([A(n) for n in (1..3*size)]))[0:size]
print(A064627List(63)) # Peter Luschny, Sep 16 2019
CROSSREFS
KEYWORD
nonn
AUTHOR
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Oct 16 2001
STATUS
approved