login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Babylonian numbers: integers in base 60 with each sexagesimal digit represented by 2 decimal digits, leading zeros omitted.
23

%I #55 Oct 22 2022 20:47:04

%S 0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,

%T 26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,

%U 49,50,51,52,53,54,55,56,57,58,59,100,101,102,103,104,105,106,107,108,109,110

%N Babylonian numbers: integers in base 60 with each sexagesimal digit represented by 2 decimal digits, leading zeros omitted.

%C From _Wolfdieter Lang_, Jan 16 2018: (Start)

%C The symbols used for 0..9 in this base 60 notation are 00, 01, ..., 09, but leading zeros are omitted.

%C For the Sumerian-Babylonian sexagesimal-decimal number system which uses two positions for each base-60 position filled with only one-digit numbers alternating between ranges of 0 to 9 and 0 to 5 see the link below.

%C (End)

%C For n < 1440, US and NATO military time designation of n minutes since midnight. - _J. Lowell_, Dec 29 2020

%D Mohammad K. Azarian, Meftah al-hesab: A Summary, MJMS, Vol. 12, No. 2, Spring 2000, pp. 75-95. Mathematical Reviews, MR 1 764 526. Zentralblatt MATH, Zbl 1036.01002.

%D Mohammad K. Azarian, A Summary of Mathematical Works of Ghiyath ud-din Jamshid Kashani, Journal of Recreational Mathematics, Vol. 29(1), pp. 32-42, 1998.

%D Georges Ifrah, Histoire Universelle des Chiffres, Paris, 1981.

%D Georges Ifrah, From one to zero, A universal history of numbers, Viking Penguin Inc., 1985.

%D Georges Ifrah, Universalgeschichte der Zahlen, Campus Verlag, Frankfurt, New York, 2. Auflage, 1987, pp. 210-221.

%H Michael De Vlieger, <a href="/A055643/b055643.txt">Table of n, a(n) for n = 0..10000</a>

%H Wolfdieter Lang, <a href="/A055643/a055643.pdf">Sumerian-Babylonian sexagesimal-decimal number system.</a>

%F a(60*n+r) = 100*a(n) + r, 0 <= r <= 59. - _Jianing Song_, Oct 22 2022

%t Array[FromDigits@ Apply[Join, PadLeft[#, 2] & /@ IntegerDigits@ IntegerDigits[#, 60]] &, 71, 0] (* _Michael De Vlieger_, Jan 11 2018 *)

%o (PARI) A055643(n)=fromdigits(digits(n,60),100) \\ _M. F. Hasler_, Jan 09 2018

%o (Python)

%o def a(n): return n if n < 60 else 100*a(n//60) + n%60

%o print([a(n) for n in range(71)]) # _Michael S. Branicky_, Oct 22 2022

%Y Cf. A049872, A131650,

%Y Note also that A250073 = a(A000079(n)), A250089 = a(A051037(n)), A254334 = a(A000244(n)), A254335 = a(A000351(n)), A254336 = a(A011557(n)).

%Y See also A281863 (value of the 0,1,2,...,n-th digit of a(n), counted from the right), A282622 (length of a(n), #digits, for n >= 1).

%K base,easy,nonn

%O 0,3

%A _Henry Bottomley_, Jun 06 2000

%E a(69) and a(70) from _WG Zeist_, Sep 08 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 16:18 EDT 2024. Contains 376119 sequences. (Running on oeis4.)