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.

A089293 Sum of digits in the mixed-base enumeration system n=...d(4)d(3)d(2)d(1), where the digits satisfy 0<=d(i)<=1 if i is odd, 0<=d(i)<=2 if i is even.

Original entry on oeis.org

0, 1, 1, 2, 2, 3, 1, 2, 2, 3, 3, 4, 1, 2, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 1, 2, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 3, 4, 4, 5, 5, 6, 4, 5, 5, 6, 6, 7, 1, 2, 2, 3, 3, 4, 2, 3, 3, 4, 4, 5, 2, 3, 3, 4, 4, 5, 3, 4, 4, 5, 5, 6, 3, 4, 4, 5, 5, 6, 4, 5, 5
Offset: 0

Views

Author

John W. Layman, Jan 15 2004

Keywords

Comments

Counting 0,1,2,3,... (base 10) in this mixed-base system proceeds as follows: 0,1,10,11,20,21,100,101,110,111,120,121,1000,.. = A109827.

Examples

			11(base 10) = 121(mixed-base), so a(11)=4.
		

Crossrefs

Cf. A109827 (mixed-base).
Sums of digits in other bases: A000120 (binary), A053735 (ternary), A053827 (base 6).

Programs

  • PARI
    a(n) = vecsum(digits(n,6)\/2); \\ Kevin Ryde, Aug 03 2021

Formula

a(n)=a(n-1)+1 if n=1, 3, 5 mod 6; a(n)=a(n-1) if n=2, 4 mod 5; a(n)=a(n/6) if n=0 mod 6.