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!)
A323701 a(n) is the number of primes p such that A007504(n) <= p < A007504(n+1). 1

%I #11 Mar 10 2019 13:32:35

%S 2,2,2,3,3,4,5,4,6,6,7,7,8,7,9,10,10,8,12,12,11,12,12,15,14,14,14,14,

%T 17,17,16,17,19,19,22,16,24,21,20,20,20,28,22,26,21,24,28,23,31,23,30,

%U 28,28,32,28,31,30,27,35,30,32,31,38,34,38,36,36,37,35,35

%N a(n) is the number of primes p such that A007504(n) <= p < A007504(n+1).

%C Corresponds to the number of terms in A321578 which are equal to n.

%e a(1)=2 because 2 <= 2, 3 < 5;

%e a(5)=3 because 28 <= 29, 31, 37 < 41.

%o (Perl) use ntheory ':all'; sub a { my $p = nth_prime($_[0]+1); my $s = sum_primes($p); prime_count($s-$p, $s-1) }; print join(", ", map { a($_) } 1..100), "\n"; # _Daniel Suteu_, Jan 25 2019

%Y Cf. A000040, A007504, A321578, A061568.

%K nonn

%O 1,1

%A _David James Sycamore_, Jan 24 2019

%E More terms from _Daniel Suteu_, Jan 25 2019

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 06:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)