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!)
A245353 Sum of digits of n written in fractional base 9/7. 0
0, 1, 2, 3, 4, 5, 6, 7, 8, 7, 8, 9, 10, 11, 12, 13, 14, 15, 12, 13, 14, 15, 16, 17, 18, 19, 20, 15, 16, 17, 18, 19, 20, 21, 22, 23, 16, 17, 18, 19, 20, 21, 22, 23, 24, 23, 24, 25, 26, 27, 28, 29, 30, 31, 22, 23, 24, 25, 26, 27, 28, 29, 30, 27, 28, 29, 30, 31 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
The base 9/7 expansion is unique and thus the sum of digits function is well-defined.
LINKS
FORMULA
a(n) = A007953(A024655(n)).
EXAMPLE
In base 9/7 the number 14 is represented by 75 and so a(14) = 7 + 5 = 12.
PROG
(Sage) # uses [basepqsum from A245355]
[basepqsum(9, 7, w) for w in [0..200]]
CROSSREFS
Sequence in context: A017883 A269364 A309384 * A063278 A355459 A110011
KEYWORD
nonn,base
AUTHOR
Hailey R. Olafson, 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 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)