login
This site is supported by donations 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

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

EXAMPLE

In base 9/5 the number 11 is represented by 52 and so a(11) = 5 + 2 = 7.

PROG

(Sage)

def base95sum(n):

....L=[n]

....i=1

....while L[i-1]>=9:

........x=L[i-1]

........L[i-1]=x.mod(9)

........L.append(5*floor(x/9))

........i+=1

....return sum(L)

[base95sum(y) for y in [0..200]]

CROSSREFS

Cf. A024653, A053830, A007953.

Sequence in context: A160597 A282779 A245350 * A097377 A234741 A063917

Adjacent sequences:  A245351 A245352 A245353 * A245355 A245356 A245357

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified February 21 07:18 EST 2018. Contains 299390 sequences. (Running on oeis4.)