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.

A216467 Smallest numbers in the coordinates of the isolated visible lattice points in the infinite square grid.

This page as a plain text file.
%I A216467 #27 Sep 02 2019 14:40:45
%S A216467 21,35,39,45,51,55,57,69,75,77,85,87,91,93,95,99,105,111,115,117,119,
%T A216467 123,133,135,141,143,145,147,153,155,159,161,165,171,175,177,183,185,
%U A216467 187,189,195,201,203,205,207,209,213,215,217,219,221,225,231,235,237,244,245
%N A216467 Smallest numbers in the coordinates of the isolated visible lattice points in the infinite square grid.
%C A216467 See A178793, A178794 for terminology.
%C A216467 It is not clear to me how many - if any! - of these terms are known to be correct. - _N. J. A. Sloane_, Oct 17 2012
%C A216467 From _Charlie Neder_, Jun 27 2018: (Start)
%C A216467 For row k to contain an isolated lattice point, k must contain a pair (m-1,m+1) of nontotatives, and both k-1 and k+1 must contain a triple of consecutive nontotatives. The CRT can then be used to "align" the groups into a box containing a lattice point. We consider the cases when k is odd and when k is even:
%C A216467 a) k is odd:
%C A216467   k cannot be a prime p or a power of a prime, because then the nontotatives to k are precisely the multiples of p, which contain no pairs since k is odd and therefore p > 2. As long as k is divisible by at least two odd primes, a pair can be found by the CRT.
%C A216467   k-1 and k+1 are even but cannot be powers of two, since then the nontotatives would be the even numbers, which contain no triples. As long as they each have at least one odd divisor, then all the odd nontotatives will be centers of triples.
%C A216467 b) k is even:
%C A216467   There are no other restrictions on k itself, since pairs are very easy to find for even k. (e.g. for any prime p not dividing k, (p-1,p+1) is a valid pair)
%C A216467   k-1 and k+1 are both odd and must be the products of at least three distinct primes, since a triple could not form otherwise. The CRT can be used to find triples as long as this is the case.
%C A216467   The first such even k is 664, with isolated point (189449,664) on it. (End)
%t A216467 Select[Range[300], If[OddQ[#], !PrimePowerQ[#] && !PrimePowerQ[# - 1] && !PrimePowerQ[# + 1], PrimeOmega[# - 1] > 2 && PrimeOmega[# + 1] > 2]&] (* _Jean-François Alcover_, Sep 02 2019, after _Andrew Howroyd_ *)
%o A216467 (PARI) select(k->if(k%2, !isprimepower(k) && !isprimepower(k-1) && !isprimepower(k+1), omega(k-1)>2 && omega(k+1)>2), [1..300]) \\ _Andrew Howroyd_, Jun 27 2018
%Y A216467 Cf. A178793, A178794, A157428, A157429.
%K A216467 nonn
%O A216467 1,1
%A A216467 _Gregg Whisler_, Sep 07 2012
%E A216467 Several missing terms added by _Charlie Neder_, Jun 27 2018
%E A216467 More terms from _Jean-François Alcover_, Sep 02 2019