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

Luca Petrone luca.petrone at libero.it
Tue Feb 16 20:46:37 CET 2021


Dear Andre,
all the sequences are available at oeis.org/stripped.gz
Each line has the form Annnnnn,a(1),a(2),a(3),...
Using the programming language you prefer, you can read it line-by-line, extract the terms and make the test you want, in your case simply:
If a(1) = 1 And a(2) = 3 And a(3) = 30 And a(4) > 500 Then...
Best, Luca
> Il 15/02/2021 21:03 andre maute <andre.maute at gmx.de> ha scritto:
> 
>  
> Hi list,
> 
> As pointed out in my last reply
> 
> When I started this thread, I only had the 3 numbers
> 1, 3, 30.
> 
> And my post dealt with this situation.
> For that moment in time I just had
> not that much information, three numbers,
> it would have been really beneficial to have some kind of functionality
> for restricting a single additional sequence element.
> 
> Removing one number of such a small set of numbers
> is really not that helpful. as pointed out in my last reply.
> 
> And as pointed out a little bit earlier
> A(4) already needed 1500min. The computation of
> A(1), A(2), A(3) need only milliseconds.
> 
> So I started the computation for A(4) multiple times,
> additionally sorting out some errors,
> without knowing how long it would take for completion.
> 
> I wondered how cool would it be to check some
> sequences in the meantime but navigating a result
> with thousands of sequences seems a little bit awkward to me.
> 
> Regards
> Andre
> 
> 
> On 2/15/21 9:32 AM, jean-paul allouche wrote:
> > Hi
> >
> > If I am not mistaken, you gave the values:
> > A(1) = 1, A(2) = 3, A(3) = 30, A(4) = 1080
> > Sorting out the first one and dividing the
> > remaining terms by 3, gives
> > 1, 10, 360
> > Feeding the oeis with these three values
> > gives only two matches
> >
> > best
> > jp
> >
> >
> >
> > Le 13/02/2021 à 10:53, andre maute a écrit :
> >> This misses the whole point of my question and ignores
> >> the situation when I started this thread.
> >>
> >> At the beginning of this thread I only had three numbers available
> >> 1, 3, 30
> >>
> >> Essentially your suggestion results in the reduced "sequence" of two numbers
> >>
> >> 1, 10
> >>
> >> and a search on oeis.org with these two numbers gives at the moment 7443 results.
> >>
> >> Quite a lot to check these by hand.
> >>
> >> Andre
> >>
> >> On 2/11/21 10:33 AM, Hugo Pfoertner wrote:
> >>> 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/
> >>>>
> >>>
> >>> --
> >>> Seqfan Mailing list - http://list.seqfan.eu/
> >>>
> >>
> >>
> >> --
> >> Seqfan Mailing list - http://list.seqfan.eu/
> >
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> 
> 
> --
> Seqfan Mailing list - http://list.seqfan.eu/



More information about the SeqFan mailing list