

A245345


Sum of digits of n written in fractional base 9/2.


0



0, 1, 2, 3, 4, 5, 6, 7, 8, 2, 3, 4, 5, 6, 7, 8, 9, 10, 4, 5, 6, 7, 8, 9, 10, 11, 12, 6, 7, 8, 9, 10, 11, 12, 13, 14, 8, 9, 10, 11, 12, 13, 14, 15, 16, 3, 4, 5, 6, 7, 8, 9, 10, 11, 5, 6, 7, 8, 9, 10, 11, 12, 13, 7, 8, 9, 10, 11, 12, 13, 14, 15, 9, 10, 11, 12
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


COMMENTS

The base 9/2 expansion is unique and thus the sum of digits function is welldefined.


LINKS

Table of n, a(n) for n=0..75.


FORMULA

a(n) = A007953(A024650(n))


EXAMPLE

In base 9/2 the number 19 is represented by 41 and so a(19) = 4 + 1 = 5.


PROG

(Sage)
def basepqsum(p, q, n):
....L=[n]
....i=1
....while L[i1]>=p:
........x=L[i1]
........L[i1]=x.mod(p)
........L.append(q*floor(x/p))
........i+=1
....return sum(L)
[basepqsum(9, 2, i) for i in [0..100]]


CROSSREFS

Cf. A024650, A007953, A000120, A053830, A244040.
Sequence in context: A151950 A104418 A173528 * A043268 A238593 A279649
Adjacent sequences: A245342 A245343 A245344 * A245346 A245347 A245348


KEYWORD

nonn,base


AUTHOR

Tom Edgar, Jul 18 2014


STATUS

approved



