That's what the page is thought for :-)

I understood your question in a more restrictive sense:

"How can one find a 'building rule' for that sequence,
if the approach with gfun does not work?"

But for that I do not have an answer ...

That's what the page is thought for :-)

I understood your question in a more restrictive sense:

"How can one find a 'building rule' for that sequence,
if the approach with gfun does not work?"

But for that I do not have an answer ...

If I understand you correctly, then { n in IN | g(n) = 1 } is non-finite.

Then it is non-polynomial, of course.

Could you tell something more about the problem?

If I understand you correctly, then { n in IN | g(n) = 1 } is non-finite.

Then it is non-polynomial, of course.

Could you tell something more about the problem?

where I have to commit:

I am not aware how to work with those polynomial algebras A = R[some indets] / ideal
using Maple, but there should be something towards that

where I have to commit:

I am not aware how to work with those polynomial algebras A = R[some indets] / ideal
using Maple, but there should be something towards that

diff(functionmodel,Q$2): # http://en.wikipedia.org/wiki/Concave_function
simplify(%, size);       # to show the sign 
eval(%, [mu[1] = 1, mu[2] = -2*0, sigma[1] = 4, sigma[2] = 2, rho = .9, Q = 2.835380684]):
evalf(%);

                            0.07414311113

It depends on the parameters, (sigma[1]*mu[2]+sigma[2]*rho*(Q-mu[1])) gives the sign

diff(functionmodel,Q$2): # http://en.wikipedia.org/wiki/Concave_function
simplify(%, size);       # to show the sign 
eval(%, [mu[1] = 1, mu[2] = -2*0, sigma[1] = 4, sigma[2] = 2, rho = .9, Q = 2.835380684]):
evalf(%);

                            0.07414311113

It depends on the parameters, (sigma[1]*mu[2]+sigma[2]*rho*(Q-mu[1])) gives the sign

functionmodel; diff(%,Q);
convert(%, erfc);
simplify(%, size); collect(%, erfc);

shows it is a cumulative + complementary normal pdf with some
parameters. In some cases it will have no zero at all, mu2 =0.

The behaviour depends on the parameters

functionmodel; diff(%,Q);
convert(%, erfc);
simplify(%, size); collect(%, erfc);

shows it is a cumulative + complementary normal pdf with some
parameters. In some cases it will have no zero at all, mu2 =0.

The behaviour depends on the parameters

To be more concrete it is the version

  Int('z -> 1/z*dF(z,y)*BesselI(lambda,z)', 8..100);
  evalf(%);

Also note, this uses a Capital Letter Int, not the lOWER cASE

If 'usual' precision is enough, the you can use method=xxxxx
to speed up

To be more concrete it is the version

  Int('z -> 1/z*dF(z,y)*BesselI(lambda,z)', 8..100);
  evalf(%);

Also note, this uses a Capital Letter Int, not the lOWER cASE

If 'usual' precision is enough, the you can use method=xxxxx
to speed up

"n not integer?" possibly was meant as question for the original poster ...

"n not integer?" possibly was meant as question for the original poster ...

(x^n)^4/x^2-(x^n)^4*R/x^4+1/(4*n^2); #to yield
eval(%, x=sqrt(z));
combine(%);

                    (2 n - 1)      (2 n - 2)    1
                   z          - R z          + ----
                                                  2
                                               4 n