proposed
approved
Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
111497, 258527, 286777, 318407, 332767, 341827, 358447, 439787, 473887, 480737, 495377, 634187, 647417, 658367, 663857, 703837, 732497, 816317, 819787, 827767, 843067, 862307, 937777, 970457, 970537, 1001267, 1012147, 1032727, 1052707, 1055827, 1104307, 1117877, 1164817, 1165837
(PARI) o=A033447(n, p=2, show_all=1, g=12, c, o)=0; {forprime(q=p+1, 5e6, , if(p+12=g!=(p=q)||, next; , q=!=o+24&& c++||2*g, c=0; 2, c++>13, show_all&& print1(o-12g", "); n--||break); o=q-12g) ; o-g} \\ Increase or remove upper limit Can be used as next(p)=A033447(1, p+1) to print more terms. - _Mget the next term, e. Fg. Hasler_, Oct 26 2018:
p=0; A033447_vec=vector(30, i, p=A033447(1, p+1)) \\ M. F. Hasler, Oct 26 2018
proposed
editing
editing
proposed
Minimal first difference a(n+1)-a(n) = 40, and this occurs first at a(709) = 26930767, a(11357) = 655389367 and a(23339) = 1510368877; all a(n) are == 7 mod 30. (End)
(PARI) o=p=c=0; forprime(q=1, 5e6, p+12==(p=q)||next; q==o+24&& c++||c=0; c>1&& print1(o-12", "); o=q-12) \\ Increase or remove upper limit to print more terms. - M. F. Hasler, Oct 26 2018
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed