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

[andre maute]

On 3/8/21 6:41 AM, Hugo Pfoertner wrote:
>   Then please submit your results as a new sequence instead of spoiling the
> suggestions of some of the most experienced people on the OEIS staff.  It
> seems that you don't want any good advice at all, you just want to promote
> your ongoing investigation.

Charles Greathouse's answer was a helpful and great answer.
This sparked my decision for more than 3 weeks
of nonstop calculations on my desktop computer.
So it was an obligation for me to give an update here.

Searching for neighbour sequences e.g. was not.
Killing common factors and removing some sequence members
didn't work for me either. I did that quite for a while.

> It would have been much more useful if you had
> provided more information on this " A(d) somehow counts the number of ways
> to reconnect the d-simplices of a particular dissected d-hypercube"

At the moment, I dont have a texed definition of my problem.
My C++-Code is quite big, even the definition of the hypercube dissection.
Hugo, wouldn't that be a potential trap for me to possibly trigger/force you
to "proofread" my program, if I posted it here prematurely?

> than to pretend that all the people who have advised you are ignorant people.

Hugo, could you please tell me were I said something like that?
If in any case I did that, I would like to honestly apologize me here.
I am withdrawing from this discussion now to prevent further ad hominem arguments.

Hugo, I would like to say sorry if I misread and ignored your A203478 sequence hint.

Andre

> On Mon, Mar 8, 2021 at 5:39 AM andre maute <andre.maute at gmx.de> wrote:
>
>> Hello list,
>>
>> looks like I have one more sequence member,
>>
>> A(1) = 1, A(2) = 3, A(3) = 30, A(4) = 1080, A(5) = 570
>>
>> So Charles idea with A203478 and A028362 doesn't work
>>
>> Andre
>>
>> On 2/16/21 9:39 PM, Charles Greathouse wrote:
>>> For the original question, I don't know of better approaches than (1)
>> using
>>> stripped.gz to restrict matches to the beginning, optionally skipping the
>>> first term, and (2) finding relationships manually (dividing out factors,
>>> etc.).
>>>
>>> With the first three terms I wouldn't have found anything, but with the
>>> fourth I found
>>> A203478(n) = A028362(n+1) * 2^(n*(n-1)/2)
>>> which may be relevant to you.
>>>
>>> On Thu, Feb 11, 2021 at 1: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/
>