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!)
 A118382 Primitive Orloj clock sequences; row n sums to 2n-1. 7
 1, 1, 2, 1, 2, 2, 1, 2, 3, 1, 1, 2, 3, 3, 1, 2, 1, 2, 4, 1, 1, 1, 1, 3, 2, 2, 3, 1, 2, 3, 4, 3, 2, 1, 1, 1, 1, 2, 4, 1, 4, 2, 1, 1, 1, 3, 1, 2, 1, 5, 2, 2, 1, 2, 3, 1, 3, 3, 2, 6, 1, 2, 2, 1, 3, 1, 3, 2, 5, 1, 1, 1, 1, 2, 2, 1, 4, 1, 4, 1, 4, 1, 4, 1, 2, 3, 3, 1, 2, 3, 3, 3, 3, 3, 1, 2, 1, 2, 1, 1, 2, 5, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS An Orloj clock sequence is a finite sequence of positive integers that, when iterated, can be grouped so that the groups sum to successive natural numbers. There is one primitive sequence whose values sum to each odd m; all other sequences can be obtained by repeating and refining these. Refining means splitting one or more terms into values summing to that term. The Orloj clock sequence is the one summing to 15: 1,2,3,4,3,2, with a beautiful up and down pattern. These are known in some papers as Sindel sequences. It appears that this sequence was submitted prior to the first such publication. LINKS Michal Krížek, Alena Šolcová and Lawrence Somer, Construction of Šindel sequences, Comment. Math. Univ. Carolin., 48 (2007), 373-388. FORMULA Let b(i),0<=i= n, tri -= n); found[tri] = 1); last = 0; r = []; for(i = 1, n, if(found[i], r = concat(r, [i-last]); last = i)); r} CROSSREFS Cf. A028355, A118383. Length of row n is A117484(2n-1) = A000224(2n-1). Sequence in context: A014643 A236265 A238645 * A007723 A067437 A242425 Adjacent sequences:  A118379 A118380 A118381 * A118383 A118384 A118385 KEYWORD nonn,tabf AUTHOR Franklin T. Adams-Watters, Apr 26 2006 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 June 21 06:24 EDT 2021. Contains 345358 sequences. (Running on oeis4.)