A026180 a(n) = s(k), where k is the n-th number such that s(j)<s(k) for all j<k, where s = A026177.

1, 4, 10, 12, 16, 22, 28, 30, 34, 36, 40, 46, 48, 52, 58, 64, 66, 70, 76, 82, 84, 88, 90, 94, 100, 102, 106, 108, 112, 118, 120, 124, 130, 136, 138, 142, 144, 148, 154, 156, 160, 166, 172, 174, 178, 184, 190, 192, 196, 198, 202, 208

Offset

1,2

Comments

RECORDS transform of A026177. - R. J. Mathar, Mar 23 2026

Links

Table of n, a(n) for n=1..52.

F. M. Dekking, Permutations of N generated by left-right filling algorithms, arXiv:2001.08915 [math.CO], 2020, see R_orec in section 2.3.

Formula

a(n) = A026177(A026179(n)). - R. J. Mathar, Mar 23 2026

Maple

A026180 := proc(n)
    option remember ;
    if n = 1 then
        1;
    else
        for j from 1 do
            if A026177(j) > procname(n-1) then
                return A026177(j) ;
            end if;
        end do:
    end if;
end proc:
seq(A026180(n), n=1..300) ; # R. J. Mathar, Mar 23 2026

Crossrefs

Cf. A026177, A026179 (positions of records).

Sequence in context: A095275 A366530 A117099 * A109274 A071565 A233741

Adjacent sequences: A026177 A026178 A026179 * A026181 A026182 A026183

Keyword

nonn

Author

Clark Kimberling

Status

approved