cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A088365 Local maxima of A053707 (first differences of A025475, powers of a prime but not prime).

This page as a plain text file.
%I A088365 #2 Mar 30 2012 17:27:41
%S A088365 4,9,17,40,74,54,151,120,307,312,199,408,356,424,912,1032,1217,840,
%T A088365 1872,423,1608,2518,1588,1920,1230,2112,3713,1560,5208,2832,3952,2872,
%U A088365 3192,3288,3432,8400,5738,4080,4272,4512,6288,8280,8520,5232,5352,3672,8892
%N A088365 Local maxima of A053707 (first differences of A025475, powers of a prime but not prime).
%C A088365 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).
%C A088365 A088366 gives the corresponding indices. Local minima of A053707 are in A088363.
%e A088365 The first six terms of A053707 are 3,4,1,7,9,2, hence A053707(2) = 4 is the first and A053707(5) = 9 is the second local maximum of A053707.
%o A088365 (PARI) {m=1; k=0; for(n=2,250000,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))}
%Y A088365 Cf. A025475, A053707, A088366, A088363.
%K A088365 nonn
%O A088365 1,1
%A A088365 _Klaus Brockhaus_, Sep 27 2003