Sequences - Xref - Options - remove

{sequence '5..9', push='b'}{/sequence}{sequence '3;7;11', push='c'}{/sequence}{sequence '1..20000', push='d'}{/sequence}[{sequence '1..4', make, list=pull:b}{$sequence} {/sequence}][{sequence '1..12', keep, list=pull:b}{$sequence} {/sequence}][{sequence '1..12', keep, list=pull:b, remove, list=pull:c}{$sequence} {/sequence}][{sequence '1..3', make, list=pull:c, make, list=pull:b}{$sequence} {/sequence}][{sequence '1..20000', keep, list=pull:d, count}{$sequence}{/sequence}][{sequence '19998..20001', make, list=pull:d}{$sequence} {/sequence}]

{sequence loop, from=6, rows=8, remove='power|2'}
  {$sequence},
{/sequence}

[{sequence '4;1e20', flag='xor'}{$sequence} {/sequence}][{sequence '4;1e20', keep='round'}{$sequence} {/sequence}][{sequence '1;1e20;3', remove, even}{$sequence} {/sequence}][{sequence '70;3', make, power=2, flag='even'}{$sequence} {/sequence}][{sequence '-4;4', make, exponentiation=0.5, flag='odd'}{$sequence} {/sequence}][{sequence '4;1e20', push='s'}{pull:s remove='and'}{$sequence} {/pull:s}]

a[{sequence '1..10', keep='even', multiply=3}{$sequence} {/sequence}]
b[{sequence '1..10', multiply=3, keep='even'}{$sequence} {/sequence}]
c[{sequence '1..10', remove='odd', add=100}{$sequence} {/sequence}]
d[{sequence '1..10', flag='prime', add=1}{$sequence} {/sequence}]
e[{sequence '1..10', keep, odd, remove='square', prime}{$sequence} {/sequence}]

[{sequence '1..10', keep, even, build='make'}{$sequence} {/sequence}][{sequence '1..10', remove, even, build='make'}{$sequence} {/sequence}][{sequence '1..10', flag, even, build='make'}{$sequence}{/sequence}][{sequence '1..10', remove, multiple=3, build='make'}{$sequence} {/sequence}][{sequence '1..10', remove, prime}{$sequence} {/sequence}][{sequence '1..6', remove, odd, build='make'}{$sequence} {/sequence}]

<?php

  // A default reach of 100 candidates, so the values asked about stand past the terms made
  // first: each is looked for as far as itself, whatever the terms made so far would project.

  $padSeqDefaultTries = 100;

  // The walks run far - a second or more of candidates - and the gate fetches twelve cases at
  // once: the five seconds a sequence has by default ran out on a busy machine and the
  // answer came back short. The budget is not what this case asserts. Nor is PHP's own limit:
  // on a loaded machine the walk took more than its 30 seconds of processor time and the
  // case ended on "Maximum execution time exceeded".

  $padSeqMaxSeconds = 60;

  set_time_limit ( 120 );

?>

[{sequence '150;500;1000;4000', keep, eval='@ + 1'}{$sequence} {/sequence}][{sequence '150;500;1000;4000', flag, eval='@ + 10'}{$sequence}{/sequence}][{sequence '1000;300;101', keep, eval='@ + 100'}{$sequence} {/sequence}][{sequence '200;400;600', keep, ceil=200}{$sequence} {/sequence}][{sequence '120;240', keep, floor=120}{$sequence} {/sequence}][{sequence '300;600;900', keep, round=300}{$sequence} {/sequence}][{sequence '500;1000;1500', remove, floor=500}{$sequence} {/sequence}][{sequence '202;203;6', keep, eval='@ le 100 ? @ * 3 : @ + 1'}{$sequence} {/sequence}][{sequence '500;7', keep, eval='@ le 100 ? 101 - @ : @'}{$sequence} {/sequence}]

{sequence prime, rows=12, from=10, remove}
  {$sequence},
{/sequence}

{sequence loop, from=1, to=12, remove='prime'}
  {$sequence},
{/sequence}

{sequence loop, rows=12, from=10, remove='prime'}
  {$sequence},
{/sequence}