login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A245354
Sum of digits of n in fractional base 9/5.
0
0, 1, 2, 3, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 10, 11, 12, 13, 6, 7, 8, 9, 10, 11, 12, 13, 14, 11, 12, 13, 14, 15, 16, 17, 18, 19, 8, 9, 10, 11, 12, 13, 14, 15, 16, 13, 14, 15, 16, 17, 18, 19, 20, 21, 14, 15, 16, 17, 18, 19, 20, 21, 22, 19, 20, 21, 22, 23
OFFSET
0,3
COMMENTS
The base 9/5 expansion is unique, and thus the sum of digits function is well-defined.
EXAMPLE
In base 9/5 the number 11 is represented by 52 and so a(11) = 5 + 2 = 7.
PROG
(Sage) # uses [basepqsum from A245355]
[basepqsum(9, 5, y) for y in [0..200]]
CROSSREFS
KEYWORD
nonn,base
AUTHOR
James Van Alstine, Jul 18 2014
STATUS
approved