3 ms·

There seems to be a problem with the mining. LODA programs are described as being programs "for an OEIS sequence" when they merely match in the limited number o

by tromp 5y ago

There seems to be a problem with the mining. LODA programs are described as being programs "for an OEIS sequence" when they merely match in the limited number of terms given in the OEIS summary, even when it obviously doesn't describe the full sequence. An example is the entry for an inverse TREE function [1] A300402 (program): Smallest integer i such that TREE(i) >= n. which is claimed to correspond to LODA program min $0,4 div $0,2 add $0,1 [1] https://oeis.org/A300402 https://oeis.org/A300402

ckrause 5y ago
In general, we can validate only up to a finite number of terms. Yes, there are incorrect programs, because for some sequences there are just too few terms, or it is hard to distinguish the sequence from others. These are the current requirements: - the OEIS sequence must have at least 10 terms - the first 100 terms must match (if it has so many terms) - if it has more than 100 terms, we check up to 2000 terms. If the program yields a different term, it is discarded. It is accepted if the program can't be evaluated for n>100 because the maximum number of steps exceeded or the number get too big.