Identification of fractional sequences

[Brendan McKay]

Valery's observation suggests that the search engine should allow
a query that finds all sequences which are term-wise multiples
of a given sequence.  That could have other uses too (and just
because I can't think of any right doesn't mean people won't
find them).

Brendan.

* Valery Liskovets <liskov at im.bas-net.by> [070421 20:42]:
> Dear Neil,
> 
> I see, a good advise. But it implies I think that I may need,
> in principle, in most unclear cases, be capable to identify all
> integer sequences c(n) (at least "nice") in the OEIS divisible
> elementwise (at least for starting n) by b(n) (or by a(n), instead).
> This doesn't look an easy task.
> 
> Valery Liskovets
> 
> "N. J. A. Sloane" wrote:
> 
> > Valery,  you said:
> >
> > > Thanks! But will this work if the denominators and numerators
> > > are in reality more complicated than factorials but still
> > > quite familiar sequences whose corresponding elements are
> > > sometimes simultaneously even or/and divisible by 3, etc.?
> >
> > My answer: normalize the denominators so that they
> > are some recognziable sequence:
> >
> > That is, write f(n) = a(n)/b(n), where you understand b(n).
> >
> > Now concentrate on a(n), which you
> > can look up in the OEIS, send to superseeker, etc.
> >
> > Of course they will be several choices for the denominator
> > sequence {b(n)} - try them all!
> >
> > Neil
>