This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A292081 #33 Nov 04 2023 08:47:25
%S A292081 35,65,95,115,161,155,217,185,215,235,329,265,371,305,427,335,365,511,
%T A292081 395,415,581,445,623,1246,485,515,545,565,791,1417,1243,1469,2071,635,
%U A292081 655,917,695,973,1507,1529,755,1057,785,1099,815,835,1169,865,1211,905,1267
%N A292081 Let b(k) be A056240(k); this sequence lists numbers b(2n) such that for some m > n, b(2m) < b(2n).
%C A292081 Subsequence of even argument terms b(2n) of A056240 (listed in order), which do not appear in A288313. - _David James Sycamore_, Sep 13 2017
%H A292081 Ivan N. Ianakiev, <a href="/A292081/b292081.txt">Table of n, a(n) for n = 1..1000</a>
%e A292081 b(12) = 35 is included since b(14) = 33 < 35.
%e A292081 b(28) = 115 is in since b(32) = 87, b(34) = 93, and b(40) = 111 are all less than 115.
%t A292081 a056240=Cases[Import["https://oeis.org/A056240/b056240.txt","Table"],{_,_}][[All,2]]; even=Take[a056240,{1,Length[a056240],2}];leven=Length[even]; a292081= Select[even,#>Min[Part[even,1;;Position[even,#][[1,1]]]]&&#>Min[Part[even,Position[even,#][[1,1]];;leven]]&] (* _Ivan N. Ianakiev_, Nov 02 2023 *)
%Y A292081 Cf. A056240, A288813.
%K A292081 nonn
%O A292081 1,1
%A A292081 _David James Sycamore_, Sep 12 2017