  Can one find an integer $g$ and a polynomial $f$, such that $g$ is a
primitive root for many consecutive (different) prime values assumed by $f$?
Moree considered this problem in 2007 with computational assistence from Gallot
and concentrated on the case where $f$ is quadratic. Recently Akbary and
Scholten (Math. Comp., to appear) extended this work and also considered the
case where $f$ is linear and cubic. In their paper they improved on a record of
the authors in the quadratic case. However, mistakingly Moree had not mentioned
in the 2007 paper the then record (from 2006), but only an older record. The
2006 record (due to Gallot) actually exceeds the 'record' from Akbary and
Scholten. Aside from pointing this out, the goal of the note is to attend
people to the problem mentioned in the first sentence of the abstract and point
out some connections with recent spectacular work of Maynard and highly
interesting work of Pollack.
