[seqfan] Re: searching on oeis.org for sequences with partial information

[Hugo Pfoertner]

Perhaps the general recommendation to leave out initial terms, especially 0
and 1, in a search is applicable here. This then gives a hit to A203478,
for example. In addition, you should always try a search with common
factors divided out, in this case factor 3, which then e.g. results in a
hit for "1, 10, 360" on A301310. My search program, with which this is
possible automatically and which I presented here some time ago (
http://list.seqfan.eu/pipermail/seqfan/2020-October/021017.html ), seems to
be used by no one except myself.

On Thu, Feb 11, 2021 at 7:28 AM andre maute <andre.maute at gmx.de> wrote:

> FYI, i have now the fourth term of this sequence
>
> A(1) = 1, A(2) = 3, A(3) = 30, A(4) = 1080
>
> The fifth term is out of scope at the moment,
> because my C++ program needed already 1500 minutes for A(4).
>
> A(d) somehow counts the number of ways to reconnect
> the d-simplices of a particular dissected d-hypercube.
>
> Andre
>
> On 2/9/21 9:30 PM, andre maute wrote:
> > Hello list,
> >
> > I have sometimes the following problem when doing some type of
> enumeration.
> > I wonder if there is already a feature on oeis.org which would help
> here.
> >
> > Suppose you have written a program generating
> > a sequence A(n), which does some intermediate (debug) output.
> >
> > The computation of the A(n) gets slower and slower with the next n,
> > but due to the availability of the intermediate output it is possible
> > to extract perhaps some lower bound for a particular A(n).
> >
> > So you have e.g.
> > A(1) = 1, A(2) = 3, A(3) = 30, A(4) > 500
> >
> > Would it possible to use this information, for an oeis.org search?
> >
> > For this sequence I would like to enter:
> > "1, 3, 30, >500"
> >
> > Best Regards
> > Andre
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>