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.

A176180 Primes p such that gcd(p(n)-1, p(n+1)-1) != gcd(p(n)+1, p(n+1)+1).

This page as a plain text file.
%I A176180 #5 Aug 02 2019 21:55:17
%S A176180 7,13,19,23,31,37,43,47,53,61,67,73,79,83,89,97,103,109,113,127,131,
%T A176180 139,151,157,163,167,173,181,193,199,211,223,229,233,241,251,257,263,
%U A176180 271,277,293,307,313,331,349,353,359,367,373,379,383,389,397,401,409,421
%N A176180 Primes p such that gcd(p(n)-1, p(n+1)-1) != gcd(p(n)+1, p(n+1)+1).
%t A176180 lst={};Do[p0=Prime[n];p1=Prime[n+1];If[GCD[p0-1,p1-1]!=GCD[p0+1,p1+1],AppendTo[lst,p0]],{n,6!}];lst
%Y A176180 Cf. A063091
%K A176180 nonn
%O A176180 1,1
%A A176180 _Vladimir Joseph Stephan Orlovsky_, Apr 11 2010