OFFSET
0,2
LINKS
Chai Wah Wu, Table of n, a(n) for n = 0..10000
Cernenoks J., Iraids J., Opmanis M., Opmanis R., Podnieks K., Integer complexity: experimental and analytical results II, arXiv:1409.0446 [math.NT] (September 2014)
K. Podnieks, Digits of pi: limits to the seeming randomness, arXiv:1411.3911 [math.NT], 2014.
MAPLE
S:=n->add(i, i in convert(5^n, base, 3)); [seq(S(n), n=0..100)];
PROG
(Python)
def digits(n, b=10): # digits of n in base 2 <= b <= 62
x, y = n, ''
while x >= b:
x, r = divmod(x, b)
y += str(r) if r < 10 else (chr(r+87) if r < 36 else chr(r+29))
y += str(x) if x < 10 else (chr(x+87) if x < 36 else chr(x+29))
return y[::-1]
def A261010(n):
return sum([int(d) for d in digits(5**n, 3)]) # Chai Wah Wu, Aug 14 2015
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Aug 14 2015
STATUS
approved