A288915 Run lengths in A039704.

1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 1, 1, 3, 1, 1, 2, 1, 4, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 3, 3

Offset: 1

Author

Zak Seidov, Jun 19 2017

Keywords

• nonn

Comments

Is the sequence bounded?

On Dickson's conjecture this sequence is unbounded. Records: a(1) = 1, a(9) = 2, a(13) = 3, a(39) = 4, a(180) = 6, a(1348) = 7, a(6698) = 8, a(8156) = 10, a(20230) = 11, a(79011) = 12, a(99250) = 13, a(710895) = 15, a(2421600) = 16, a(7128444) = 17, a(11898707) = 18, a(14368535) = 20, a(21943755) = 22, a(519775979) = 25, a(3111006505) = 27. - Charles R Greathouse IV, Jun 19 2017

Links

• Zak Seidov, Table of n, a(n) for n = 1..20000

Crossrefs

Cf. A039704, A057620, A057622.

Programs

Mathematica

Length /@ Split[Mod[Prime[Range[100]], 6]]

PARI

t=1;p=2;forprime(q=3,1e3,if((q-p)%6==0,t++,print1(t", ");t=1);p=q) \\ Charles R Greathouse IV, Jun 19 2017

Extensions

a(70) corrected by Charles R Greathouse IV, Jun 19 2017