This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245347 Sum of digits of n written in fractional base 8/3. 0

%I

%S 0,1,2,3,4,5,6,7,3,4,5,6,7,8,9,10,6,7,8,9,10,11,12,13,4,5,6,7,8,9,10,

%T 11,7,8,9,10,11,12,13,14,10,11,12,13,14,15,16,17,8,9,10,11,12,13,14,

%U 15,11,12,13,14,15,16,17,18,4,5,6,7,8,9,10,11,7,8,9

%N Sum of digits of n written in fractional base 8/3.

%C The base 8/3 expansion is unique and thus the sum of digits function is well-defined.

%F a(n) = A007953(A053829(n))

%e In base 8/3 the number 14 is represented by 36 and so a(14) = 3 + 6 = 9.

%o (Sage)

%o def base83sum(n):

%o ....L=[n]

%o ....i=1

%o ....while L[i-1]>=8:

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

%o ........L[i-1]=x.mod(8)

%o ........L.append(3*floor(x/8))

%o ........i+=1

%o ....return sum(L)

%o [base83sum(w) for w in [0..200]]

%Y Cf. A007953, A000120, A024645, A053829, A244040.

%K nonn,base

%O 0,3

%A _Hailey R. Olafson_, Jul 18 2014

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

Last modified April 24 04:00 EDT 2019. Contains 322406 sequences. (Running on oeis4.)