a_1, a_2, ..., is a permutation of the positive integers such that the average of each initial segment is an integer, using the greedy algorithm to define a_n.
A019444
a_1, a_2, ..., is a permutation of the positive integers such that the average of each initial segment is an integer, using the greedy algorithm to define a_n.
Terms
- a(0) =1a(1) =3a(2) =2a(3) =6a(4) =8a(5) =4a(6) =11a(7) =5a(8) =14a(9) =16a(10) =7a(11) =19a(12) =21a(13) =9a(14) =24a(15) =10a(16) =27a(17) =29a(18) =12a(19) =32a(20) =13a(21) =35a(22) =37a(23) =15a(24) =40a(25) =42a(26) =17a(27) =45a(28) =18a(29) =48
External references
- oeis: A019444