( and others )

I request investigating BBP - type formula's of the following type :

a = sum k = 0 .. oo [ ( b^k * p(k) * A(k) ) /q(k) ]

Where b is a gaussian rational ( Q(i) ) < 1.
p(k) and q(k) are polynomials with gaussian rational coefficients and A(k) is a vector of gaussian rationals.

The polynomials may or may not be factorable over the ring of gaussian rationals.

And it may or may not be a spigot algoritm.

Of course i am talking about non-trivial cases , where the real and imaginary parts cannot be easily rewritten as ordinary BBP-type formula's.

It would be nice to see such formula's for e.g.

zeta(3) + zeta(5) i

or

zeta(21)/zeta(7) where the imaginary part has vanished.
(assuming it can vanish in a non-trivial case )

I dont know if integer relation algoritms and its simple variants are sufficient to prove such identities.

I will leave choosing the name to Simon Plouffe himself.

Regards