OFFSET
1,2
COMMENTS
Each pair of digits constitutes the decimal value of a single sexagesimal digit, as on a digital clock, eliminating the colon (:). Any leading zeros are truncated. Thus decimal 64 appears as "104" and not "0104".
REFERENCES
D. E. Knuth, Ancient Babylonian Algorithms, Communications of the ACM 15 (1972): 671-677.
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10540 (Hamming numbers <= 60^10)
EXAMPLE
a(28) = 112 since A051037(28) = 72. 72 = 1 * 60 + 12, thus sexagesimal 1,12. Concatenating the decimal values of the sexagesimal places gives "112".
MATHEMATICA
a250089[n_Integer] := FromDigits /@ Map[StringJoin, If[# < 10, StringJoin["0", ToString[#]], ToString[#]] & /@ IntegerDigits[#, 60] & /@ Select[Range[n], Last@Map[First, FactorInteger@#] < 7 &], 2]; a250089[360] (* Michael De Vlieger, Nov 11 2014, after Robert G. Wilson v at A051037 *)
With[{n = 360}, Map[FromDigits@ IntegerDigits[#, MixedRadix[ Flatten@ ConstantArray[{6, 10}, {2 Ceiling@ Log[60, n]}]]] &, Union@ Flatten@ Table[2^p1*3^p2*5^p3, {p1, 0, Log[2, n/(1)]}, {p2, 0, Log[3, n/(2^p1)]}, {p3, 0, Log[5, n/(2^p1*3^p2)]}]]] (* Version 10.2, or *)
With[{n = 360}, FromDigits@ StringJoin@ Map[If[# < 10, StringJoin["0", ToString@ #], ToString@ #] &, IntegerDigits[#, 60]] & /@ Union@ Flatten@ Table[2^p1*3^p2*5^p3, {p1, 0, Log[2, n/(1)]}, {p2, 0, Log[3, n/(2^p1)]}, {p3, 0, Log[5, n/(2^p1*3^p2)]}]] (* Michael De Vlieger, Feb 20 2017 *)
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Michael De Vlieger, Nov 11 2014
STATUS
approved