login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A240590 Number of primes between successive powerful numbers (A001694(n)). 2
2, 2, 0, 2, 3, 0, 2, 0, 4, 3, 2, 2, 3, 3, 2, 0, 1, 3, 5, 5, 2, 1, 1, 5, 1, 7, 0, 5, 2, 4, 5, 1, 5, 2, 7, 3, 2, 2, 6, 9, 4, 4, 0, 7, 8, 2, 7, 4, 4, 8, 1, 1, 4, 4, 9, 7, 2, 1, 9, 10, 6, 1, 0, 2, 0, 9, 12, 7, 4, 12, 6, 5, 4, 5, 12, 0, 8, 3, 3, 10, 8, 0, 2, 13, 2, 13, 10, 10, 1, 15, 0, 7, 9, 9, 3, 13, 7, 4, 0, 7, 5, 4, 13, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..104.

EXAMPLE

a(9) = 4 because A001694(9) = 36, A001694(10) = 49, and there are 4 primes between them: 37, 41, 43 and 47.

PROG

(PARI)

ispowerful(n)={local(h); if(n==1, h=1, h=(vecmin(factor(n)[, 2])>1)); return(h)}

proxpowerful(n)={local(k); k=n+1; while(!ispowerful(k), k+=1); return(k)}

{for(i=1, 5000, if(ispowerful(i), m=proxpowerful(i); p=primepi(m)-primepi(i); print(p)))}

CROSSREFS

Cf. A001694, A240591.

Sequence in context: A141661 A278521 A195910 * A080769 A328903 A143539

Adjacent sequences:  A240587 A240588 A240589 * A240591 A240592 A240593

KEYWORD

nonn

AUTHOR

Antonio Roldán, Apr 08 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 11 18:46 EST 2019. Contains 329925 sequences. (Running on oeis4.)