This page makes test uses of the guessing package by Martin Rubey. Feel free to add new sequences or change the sequences to ones you like to try. See GuessingFormulasForSequences for some explanations. axiom guess([1,
Type: List(Expression(Integer))
The answer being an empty list tells us, that there is no
rational function of total degree less than 13, that generates
these numbers. Furthermore, for axiom guessExpRat [(1+x)^x for x in 0..3]
Type: List(Expression(Integer))
A workaround is necessary, because of bug #128 axiom l := [1,
Type: List(Polynomial(Integer))
axiom guessPRec(q)(l,
Type: Expression(Integer)
Here are some that are tried: axiom listA := [1, Type: List(PositiveInteger)
axiom listB := [1, Type: List(PositiveInteger)
axiom listC := [1, Type: List(PositiveInteger)
axiom guess(listA,
Type: List(Expression(Integer))
axiom guess(listB,
Type: List(Expression(Integer))
axiom guess(listC,
Type: Expression(Integer)
axiom listD := [1, Type: List(PositiveInteger)
axiom listE := [1, Type: List(PositiveInteger)
axiom guess(listD, axiom li := [-86, Type: List(Integer)
axiom guess(li,
Type: List(Expression(Integer))
"Most" sequences arising in combinatorics are P-recursive: axiom guessPRec([1, axiom guess([1,
Type: List(Expression(Integer))
... --Thomas, Sun, 27 Jan 2008 04:29:36 -0800 reply axiom guess([1,
Type: List(Expression(Integer))
axiom guess([1,
Type: List(Expression(Integer))
axiom guess([1,
Type: List(Expression(Integer))
axiom x1 := -4; Type: Integer
axiom x2 := -23/18; Type: Fraction(Integer)
axiom x3 := -139/225; Type: Fraction(Integer)
axiom x4 := -191833/529200; Type: Fraction(Integer)
axiom x5 := -472217/1984500; Type: Fraction(Integer)
axiom x6 := -48425779/288149400; Type: Fraction(Integer)
axiom x7 := -106497287263/852201850500; Type: Fraction(Integer)
axiom x8 := -25074629843/259718659200; Type: Fraction(Integer)
axiom x9 := -2162241552187/28147009690800; Type: Fraction(Integer)
axiom x10 := -2967138724292741/47418328992434400; Type: Fraction(Integer)
axiom x11 := -129037676381827/2483817232937040; Type: Fraction(Integer)
axiom x12 := -1570296205027456889/35834708624282568000; Type: Fraction(Integer)
axiom x13 := -196315863027088338517/5240826136301325570000; Type: Fraction(Integer)
axiom x14 := -182798242115965865171/5643966608324504460000; Type: Fraction(Integer)
axiom x15 := -143828683113808323224449/5085617054572401697350000; Type: Fraction(Integer)
axiom x16 := -17140536169050680284163795011/688128740913726186786391680000; Type: Fraction(Integer)
axiom x17 := -17141645969372168004324275011/775448107658460380942998200000; Type: Fraction(Integer)
axiom x18 := -463312933007625360900074503/23458934349331574549536080000; Type: Fraction(Integer)
axiom x19 := -23469273048929307035152061800459/1322079072947671102150629783240000; Type: Fraction(Integer)
axiom x20 := -572443896207988534144011140099/35683645693594361731460992800000; Type: Fraction(Integer)
axiom guess([x1,
Type: List(Expression(Integer))
|

![\label{eq4}\begin{array}{@{}l}
\displaystyle
\left[{{{f \left({n}\right)}\mbox{\rm :}}{{{q \ {f \left({n}\right)}\ {q^n}}-{f \left({n + 2}\right)}+{f \left({n + 1}\right)}}= 0}}, \:{{f \left({0}\right)}= 1}, \: \right.
\
\
\displaystyle
\left.{{f \left({1}\right)}= 1}\right]
\label{eq4}\begin{array}{@{}l}
\displaystyle
\left[{{{f \left({n}\right)}\mbox{\rm :}}{{{q \ {f \left({n}\right)}\ {q^n}}-{f \left({n + 2}\right)}+{f \left({n + 1}\right)}}= 0}}, \:{{f \left({0}\right)}= 1}, \: \right.
\
\
\displaystyle
\left.{{f \left({1}\right)}= 1}\right]](images/6288024660417633294-16.0px.png)
![\label{eq5}\left[{\prod_{
\displaystyle
{{p_{7}}= 0}}^{
\displaystyle
{n - 1}}{{{4 \ {p_{7}}}+ 2}\over{{p_{7}}+ 2}}}\right]
\label{eq5}\left[{\prod_{
\displaystyle
{{p_{7}}= 0}}^{
\displaystyle
{n - 1}}{{{4 \ {p_{7}}}+ 2}\over{{p_{7}}+ 2}}}\right]](images/8493863690807582625-16.0px.png)
