Question: What are examples of comonads on $\mathbf{Set}$ that are not polynomial?
Background: polynomial functors and comonads on Set
A functor $F\colon\mathbf{Set}\to\mathbf{Set}$ is called polynomial if it is a sum of representables, i.e. if there is some set $I$ and for each $i:I$ a set $S_i$ and a natural isomorphism $$ F(X)\cong\sum_{i:I}\mathbf{Set}(S_i, X) $$ over $X:\mathbf{Set}$.
For example, $X\mapsto X^2$ is polynomial, because we can take $I:=\{\bullet\}$ and $S_\bullet:=\{1,2\}$ and $$X^2\cong\mathbf{Set}(\{1,2\},X)\cong\sum_{i:\{\bullet\}}\mathbf{Set}(S_i,X).$$ Similarly the constant functor $X\mapsto 2$ is polynomial because we can take $I:=\{1,2\}$ and $S_1=S_2:=\varnothing$.
A comonad on $\mathbf{Set}$ is a tuple $(F,\epsilon,\delta)$ where $F\colon\mathbf{Set}\to\mathbf{Set}$ is a functor, $\epsilon\colon F\to\mathsf{id}_\mathbf{Set}$ and $\delta\colon F\to F\circ F$ are natural transformations, and these satisfy the usual "comonoid" laws, coassociativity and counitality.
Setup: It's easy to find polynomial comonads
There are many polynomial comonads on $\mathbf{Set}$; in fact, a result of Ahman and Uustalu says that they are in bijection with categories: every category can be identified with a polynomial comonad and vice versa.
But what about non-polynomial comonads? Picking up on Mathoverflow: "Big list of comonads", which asks for comonads from all around math, I ask a much more refined question.
Question:
$\quad$ What are examples of comonads on $\mathbf{Set}$ that are not polynomial?