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!)
A088363 Local minima of A053707 (first differences of A025475, powers of a prime but not prime). 2
3, 1, 2, 15, 3, 13, 18, 17, 63, 38, 168, 10, 316, 240, 128, 30, 271, 408, 286, 255, 354, 362, 600, 260, 672, 138, 7, 768, 792, 876, 960, 513, 248, 1080, 546, 2328, 1248, 4008, 1392, 751, 2188, 250, 94, 1728, 3528, 3470, 1848, 2460, 3912, 4008, 3063, 2088, 1554 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

A053707(k) for k = 1 is a term iff A053707(k) <= A053707(k+1); A053707(k) for k > 1 is a term iff A053707(k-1) > A053707(k) and A053707(k) <= A053707(k+1).

A088364 gives the corresponding indices. Local maxima of A053707 are in A088365.

LINKS

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

EXAMPLE

The first four terms of A053707 are 3,4,1,7, hence A053707(1) = 3 is the first and A053707(3) = 1 is the second local minimum of A053707.

PROG

(PARI) {m=1; k=0; for(n=2, 320000, if(matsize(factor(n))[1]==1&&factor(n)[1, 2]>1, d=n-m; if((k<2||b>c)&&(!k<1&&d>=c), print1(c, ", ")); k++; m=n; b=c; c=d))}

CROSSREFS

Cf. A025475, A053707, A088364, A088365.

Sequence in context: A163485 A276011 A126038 * A300839 A143783 A179175

Adjacent sequences:  A088360 A088361 A088362 * A088364 A088365 A088366

KEYWORD

nonn

AUTHOR

Klaus Brockhaus, Sep 27 2003

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 6 14:47 EST 2019. Contains 329806 sequences. (Running on oeis4.)