login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A268665 Number of primes p==1 (mod 3) for which A261029(2*prime(n)*p) is 4-i if prime(n)==i (mod 3), where i=1 or 2. 1

%I #79 May 07 2016 09:22:33

%S 6,9,22,26,44,52,73,111,122,164,201,214,254,311,374,398,465,521,542,

%T 617,684,774,899,969,1005,1064,1100,1181,1441,1548,1658,1694,1918,

%U 1977,2114,2255,2376,2537,2684,2727,3019,3068,3181,3238,3611,3985,4114,4182,4313

%N Number of primes p==1 (mod 3) for which A261029(2*prime(n)*p) is 4-i if prime(n)==i (mod 3), where i=1 or 2.

%e Let n=3, then prime(n)=5. Since 5==2(mod 3), then i=2. So a(3) is the number of primes p==1(mod 3) for which A261029(10*p)=4-2=2. So it is number of terms in A272381, i.e., a(3)=6.

%e Let n=4, then prime(n)=7. Since 7==1(mod 3), then i=1. So a(4) is the number of primes p==1(mod 3) for which A261029(14*p)=4-1=3. So it is number of terms in A272382, i.e., a(4)=9.

%Y Cf. A261029, A272381, A272382, A272384, A272404, A272406, A272407, A272409.

%K nonn

%O 3,1

%A _Vladimir Shevelev_ and _Peter J. C. Moses_, May 07 2016

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:29 EDT 2024. Contains 371967 sequences. (Running on oeis4.)