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.

A282622 Number of digits of the representation of n in the alternating sexagesimal-decimal number system.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
Offset: 1

Views

Author

Wolfdieter Lang, Feb 20 2017

Keywords

Comments

For a(1)..a(59) this sequence coincides with A055642.
For the alternating sexagesimal-decimal number system see a comment in A055643.

Crossrefs

Programs

  • Mathematica
    With[{nn = 120}, IntegerLength[Range@ 120, MixedRadix[Flatten@ ConstantArray[{6, 10}, {2 Ceiling@ Log[60, nn]}]]]] (* Version 10.2, or *)
    Table[StringLength@ If[StringTake[#, 1] == "0", StringDrop[#, 1], #] &@ StringJoin@ Map[If[# < 10, StringJoin["0", ToString@ #], ToString@ #] &, IntegerDigits[n, 60]], {n, 120}] (* Michael De Vlieger, Feb 20 2017 *)

Formula

a(n) = 1 for n = 1..9, a(n) = 2 for n = 10..59, a(n) = 3 for n = 60..599, a(n) = 4 for n = 600..3600, ..., i.e., a(n) = k, k >= 1, for n = A281863(k-1)..A281863(k)-1.