A334081 If the terms of this sequence are divided into groups, the lengths of which are the terms of this sequence, the k-th term in a group is one greater than the k-th term in the previous group with at least k terms or 1 if no such group exists.
1, 2, 1, 3, 4, 2, 1, 5, 3, 2, 1, 6, 4, 7, 8, 5, 3, 2, 1, 9, 6, 4, 10, 7, 11, 12, 8, 5, 3, 2, 1, 13, 9, 6, 4, 14, 10, 7, 5, 3, 2, 1, 15, 11, 8, 6, 4, 3, 2, 1, 16, 12, 9, 7, 5, 17, 13, 10, 18, 14, 19, 20, 15, 11, 8, 6, 4, 3, 2, 1, 21, 16, 12, 9, 7, 5, 22, 17, 13, 10, 23, 18, 14, 11, 8, 6, 4, 3, 2, 1
Offset: 1
Examples
-------------------- n a(n) n-th Group -------------------- 1 1 [1] 2 2 [2,1] 3 1 [3] 4 3 [4,2,1] 5 4 [5,3,2,1] 6 2 [6,4] 7 1 [7] 8 5 [8,5,3,2,1] 9 3 [9,6,4]
Links
- Samuel B. Reid, Table of n, a(n) for n = 1..10000
- Samuel B. Reid, Python program for A334081
Programs
-
Python
# See Links section.