OFFSET
1,2
COMMENTS
Suppose that q and s are polynomials and degree(q)>degree(s). The reduction of a polynomial p by q->s is introduced at A192232. If p is replaced by a function f having power series
c(0) + c(1)*x + c(2)*x^2 + ... ,
then the reduction, R(f), of f by q->s is here introduced as the limit, if it exists, of the reduction of p(n,x) by q->s, where p(n,x) is the n-th partial sum of f(x):
R(f(x)) = c(0)*R(1) + c(1)*R(x) + c(2)*R(x^2) + ... If q(x)=x^2 and s(x)=x+1, then
R(f(x)) = c(0) + c(1)*x + c(2)*(x+1) + c(3)*(2x+1) + c(4)(3x+2) + ..., so that
R(f(x)) = Sum_{n>=0} c(n)*(F(n)*x+F(n-1)), where F=A000045 (Fibonacci sequence), so that
R(f(x)) = u0 + x*u1 where u0 = Sum_{n>=0} c(n)*F(n-1), u1 = Sum_{n>=0} c(n)*F(n); the numbers u0 and u1 are given by A193010 and A098689.
Following is a list of reductions by x^2->x+1 of selected functions. Each sequence A-number refers to the constant represented by the sequence. Adjustments for offsets are needed in some cases.
FORMULA
From Amiram Eldar, Jan 18 2022: (Start)
Equals 1 + Sum_{k>=1} Fibonacci(k-1)/k!.
Equals (sqrt(5)-1) * (2*sqrt(5)*exp(sqrt(5)) + 3*sqrt(5) + 5) / (20 * exp((sqrt(5)-1)/2)). (End)
EXAMPLE
1.783922996312878767846236916090170972510...
MATHEMATICA
f[x_] := Exp[x]; r[n_] := Fibonacci[n];
c[n_] := SeriesCoefficient[Series[f[x], {x, 0, n}], n]
u0 = N[Sum[c[n]*r[n - 1], {n, 0, 200}], 100]
RealDigits[u0, 10]
KEYWORD
nonn,cons
AUTHOR
Clark Kimberling, Jul 14 2011
STATUS
approved