A026145 - cp's OEIS frontend

A026145 a(n) = s(k), where k is the n-th number such that s(j) < s(k) for all j < k, where s = A026142. Also a(n) = 2*t(n) for n >= 2, where t = A026144.

%I A026145 #8 Aug 28 2021 00:00:32
%S A026145 1,4,8,12,14,20,24,26,32,36,38,42,44,50,56,60,62,68,72,74,78,80,86,92,
%T A026145 96,98,104,108,110,114,116,122,126,128,132,134,140,146,150,152,158,
%U A026145 164,168,170,176,180,182,186,188,194,200,204,206,212,216,218,222
%N A026145 a(n) = s(k), where k is the n-th number such that s(j) < s(k) for all j < k, where s = A026142. Also a(n) = 2*t(n) for n >= 2, where t = A026144.
%H A026145 F. M. Dekking, <a href="https://arxiv.org/abs/2001.08915">Permutations of N generated by left-right filling algorithms</a>, arXiv:2001.08915 [math.CO], 2020, see R_rec in section 2.4.
%Y A026145 Cf. A026142, A026144.
%K A026145 nonn
%O A026145 1,2
%A A026145 _Clark Kimberling_

cp's OEIS Frontend

A026145 a(n) = s(k), where k is the n-th number such that s(j) < s(k) for all j < k, where s = A026142. Also a(n) = 2*t(n) for n >= 2, where t = A026144.