login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
The base 9/5 expansion is unique, and thus the sum of digits function is well-defined.
LINKS
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
Sequence in context: A305902 A245350 A307282 * A097377 A234741 A063917
KEYWORD
nonn,base
AUTHOR
James Van Alstine, Jul 18 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)