This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245346 Sum of digits of n in fractional base 10/3. 0
 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 7, 8, 9 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The base 10/3 expansion is unique, and thus the sum of digits function is well-defined. LINKS EXAMPLE In base 10/3 the number 11 is represented by 31 and so a(11) = 3 + 1 = 4. PROG (Sage) def base103sum(n): ....L=[n] ....i=1 ....while L[i-1]>=10: ........x=L[i-1] ........L[i-1]=x.mod(10) ........L.append(3*floor(x/10)) ........i+=1 ....return sum(L) [base103sum(y) for y in [0..200]] CROSSREFS Cf. A024658, A007953. Sequence in context: A318492 A061499 A178051 * A028898 A081502 A236363 Adjacent sequences:  A245343 A245344 A245345 * A245347 A245348 A245349 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 18 12:34 EDT 2019. Contains 322209 sequences. (Running on oeis4.)