Michael S. Branicky, <a href="/A367623/b367623_1.txt">Table of n, a(n) for n = 1..10000</a>
Michael S. Branicky, <a href="/A367623/b367623_1.txt">Table of n, a(n) for n = 1..10000</a>
proposed
approved
editing
proposed
Needs a b-file
Michael S. Branicky, <a href="/A367623/b367623_1.txt">Table of n, a(n) for n = 1..10000</a>
(Python)
from sympy.ntheory.factor_ import digits
def a(k, base=3):
m = k + base*(k%base)
return len([m+y for y in range(1, base) if digits(m+y, base)[1] == y])
print([a(n) for n in range(1, 96)]) # Michael S. Branicky, Dec 23 2023
proposed
editing
editing
proposed
2, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
Needs a b-file
proposed
editing
editing
proposed
allocated for N. J. A. Sloane
qqqq3
2, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
1,1
allocated
nonn
N. J. A. Sloane, Dec 23 2023
approved
editing
allocated for N. J. A. Sloane
allocated
approved