Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #33 Nov 04 2023 08:47:25
%S 35,65,95,115,161,155,217,185,215,235,329,265,371,305,427,335,365,511,
%T 395,415,581,445,623,1246,485,515,545,565,791,1417,1243,1469,2071,635,
%U 655,917,695,973,1507,1529,755,1057,785,1099,815,835,1169,865,1211,905,1267
%N Let b(k) be A056240(k); this sequence lists numbers b(2n) such that for some m > n, b(2m) < b(2n).
%C 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 Ivan N. Ianakiev, <a href="/A292081/b292081.txt">Table of n, a(n) for n = 1..1000</a>
%e b(12) = 35 is included since b(14) = 33 < 35.
%e b(28) = 115 is in since b(32) = 87, b(34) = 93, and b(40) = 111 are all less than 115.
%t 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 Cf. A056240, A288813.
%K nonn
%O 1,1
%A _David James Sycamore_, Sep 12 2017