cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A245346 Sum of digits of n in fractional base 10/3.

Original entry on oeis.org

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
Offset: 0

Views

Author

James Van Alstine, Jul 18 2014

Keywords

Comments

The base 10/3 expansion is unique, and thus the sum of digits function is well-defined.

Examples

			In base 10/3 the number 11 is represented by 31 and so a(11) = 3 + 1 = 4.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := a[n] = If[n == 0, 0, a[3 * Floor[n/10]] + Mod[n, 10]]; Array[a, 100, 0] (* Amiram Eldar, Aug 04 2025 *)
  • PARI
    a(n) = if(n == 0, 0, a(n\10 * 3) + n % 10); \\ Amiram Eldar, Aug 04 2025
  • Sage
    # uses [basepqsum from A245355]
    [basepqsum(10,3,y) for y in [0..200]]
    

Formula

a(n) = A007953(A024658(n)). - Amiram Eldar, Aug 04 2025