a(n) is the number of primes q less than primorial(n) having k = 2 as the least exponent such that q^k == 1 (mod primorial(n)).

A336016

a(n) is the number of primes q less than primorial(n) having k = 2 as the least exponent such that q^k == 1 (mod primorial(n)).

Terms

    a(0) =0a(1) =1a(2) =3a(3) =5a(4) =8a(5) =19a(6) =22a(7) =51a(8) =89a(9) =145a(10) =263a(11) =453a(12) =851a(13) =1575a(14) =2880a(15) =5469a(16) =10338a(17) =19115a(18) =35782a(19) =67569a(20) =128601a(21) =243600a(22) =463840a(23) =883589

External references