The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A028355 How the astronomical clock ("Orloj") in Prague would strike 1,2,3,...,24,25,.. (digits follow 12343212343... (A028356), n-th group adds to n). 9
 1, 2, 3, 4, 32, 123, 43, 2123, 432, 1234, 32123, 43212, 34321, 23432, 123432, 1234321, 2343212, 3432123, 4321234, 32123432, 123432123, 43212343, 2123432123, 432123432, 1234321234, 32123432123, 43212343212 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS This remarkable sequence is really a sequence of lists rather than numbers. REFERENCES Zdenek Horsky, "Prazsky Orloj" ["The Astronomical Clock of Prague", in Czech], Panorama, Prague, 1988, pp. 76-78. LINKS Seiichi Manyama, Table of n, a(n) for n = 1..2500 Michal Krížek, Alena Šolcová and Lawrence Somer, Construction of Šindel sequences, Comment. Math. Univ. Carolin., 48 (2007), 373-388. N. J. A. Sloane, My favorite integer sequences, in Sequences and their Applications (Proceedings of SETA '98). EXAMPLE 1, 2, 3, 4, 3+2=5, 1+2+3=6, 4+3=7, 2+1+2+3=8, 4+3+2=9, 1+2+3+4=10, 3+2+1+2+3=11, 4+3+2+1+2=12, 3+4+3+2+1=13, 2+3+4+3+2=14, 1+2+3+4+3+2=15, ... MATHEMATICA s[i_] := {1, 2, 3, 4, 3, 2}[[Mod[i, 6, 1]]]; m[k_] := If[k == 1, 0, For[m0 = 1, True, m0++, If[k (k - 1)/2 == Sum[s[i], {i, 1, m0}], Return[m0]]]]; n[k_] := For[n0 = m[k] + 1, True, n0++, If[Sum[s[i], {i, m[k] + 1, n0}] == k, Return[n0]]]; a[k_] := a[k] = Table[s[i], {i, m[k] + 1, n[k]}] // FromDigits; Array[a, 27] (* Jean-François Alcover, Mar 14 2016 *) CROSSREFS Cf. A028354, A028356, A068962, A118382, A118383. Sequence in context: A037324 A067242 A028354 * A074920 A180631 A102842 Adjacent sequences:  A028352 A028353 A028354 * A028356 A028357 A028358 KEYWORD nonn,nice,base AUTHOR STATUS approved

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

Last modified March 28 07:59 EDT 2020. Contains 333079 sequences. (Running on oeis4.)