According to the Wikipedia page on generalized continued fractions, $\pi$ can be given several GCF representations which have very regular structures; for example, one has the partial denominators as (1, 2, 2, 2, ...) and the partial numerators as (4, 1^{2}, 3^{2}, 5^{2}, 7^{2}, ...). My question is, can every real number be represented as a GCF that exhibits some sort of "structure"? I put that word in quotes because I'm not really sure how to define it concretely; ideally, the sequence of either partial numerators or partial denominators should be expressable using a predictable, explicit formula. Are there any theorems establishing results like this, or are there some numbers that have no GCF representation that is indistinguishable from random noise? If some numbers need to be expressed in other forms for a pattern to emerge, like Engel expansions, I'd be interested in knowing about that too.
I think under any reasonable definition there will be only countably many explicit formulas or patterns. So in fact most reals can't be expressed this way. (See also the concept of "computable number.") 


It depends on what you mean by "generalized continued fraction". Greg Martin has a nice paper where the role of reciprocal is replaced by other things; he shows that all nice things happen, and do so simultaneously. I don't agree with the negative countable/uncountable explanations (although I agree with the conclusion) given in other answers. For example, let $A(x)=(\{\lfloor n x \rfloor: n\in {\mathbb Z}\})$, and consider the simple continued fractions $y=[0;a_1,a_2,...]$ where $a_i=1$ if $i=A(x)$, and $a_i=2$ otherwise. Distinct $x$ yield distinct $y$, so we get uncountably many reals this way, all of whose simple continued fractions have "structure". 


I assume you're restricting the numerators and denominators to be integers, else there's the trivial generalized continued fraction (x;0,0,0,...) for any x. I'm going to interpret "formula" broadly, as the sequence generated by an algorithm. Again one has to make an integer restriction, because there's a simple algorithm to generate the standard continued fraction for any x. I think the right way to state the restriction is that within the algorithms generating the sequences of numberators and denominators all numerical constants should be integers. But with that restriction, the answer to your question is no: there are uncountably many real numbers and only countably many algorithms that can be used to generate generalized continued fractions. 


It's true that certain types of real numbers can be expressed as patterned generalized continued fractions, as indicated by the "Examples" section of the cited article. However, not all reals can be so expressed. For example, according to Wikipedia, the Euler–Mascheroni constant (aka "gamma" or γ) "has not been proved algebraic or transcendental. In fact, it is not even known whether γ is irrational," but finding a generalized continued fraction for γ would answer the latter question. 

