Please note that this question differs from one of the previous questions of mine.
- Let $f(n)$ be an arbitrary function with integer values.
- Let $c_n$ be an arbitrary integer sequence.
- Let $a(n)$ be an integer sequence such that $$ \sum\limits_{n=0}^{\infty}c_n x^n=\sum\limits_{n=0}^{\infty}a(n)x^n\prod\limits_{k=1}^{n+1}(1-f(k)x^k) $$
- Start with vector $\nu$ of length $n$ with elements $\nu_i = c_{i-1}$ (that is, $\nu = \{c_0, c_1, \dotsc, c_{n-1}\}$) and for $i$ from $1$ to $\left\lfloor\frac{n}{2}\right\rfloor$ and for $j$ from $2i$ to $n$ apply $\nu_{j} = f(i)\nu_{j-i} + \nu_{j}$.
I conjecture that after the whole transform we have vector $\nu$ with elements $\nu_i = a(i-1)$.
In particular, we have A209405 for $f(n)=c_n=1$.
Here is the PARI/GP program to check it numerically:
f(n) = n
c(n) = n+1
upto1(n) = my(v1); v1 = vector(n, i, c(i-1)); for(i=1, n\2, for(j=2*i, n, v1[j] += f(i)*v1[j-i])); v1
h(n, x) = my(v1); v1 = upto1(n+1); sum(i=0, n, v1[i+1]*x^i*prod(k=1, i+1, 1-f(k)*x^k)) + x*O(x^n)
test1(n) = my(x = 'x); Vec(h(n, x)) == vector(n+1, i, c(i-1))
Is there a way to prove it?