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.

A146077 Numbers n such that gcd(n, 2^n-2) does not equal the least prime factor of n.

This page as a plain text file.
%I A146077 #7 Aug 02 2019 22:59:35
%S A146077 28,35,45,55,70,77,95,105,112,115,119,143,153,154,155,161,165,175,186,
%T A146077 187,196,203,209,215,221,225,231,235,238,247,253,275,276,280,285,287,
%U A146077 295,299,319,322,323,325,329,335,341,345,355,364,371,377,385,391,395
%N A146077 Numbers n such that gcd(n, 2^n-2) does not equal the least prime factor of n.
%C A146077 Also, positive integers n where A159353(n) differs from A032742(n).
%H A146077 Harvey P. Dale, <a href="/A146077/b146077.txt">Table of n, a(n) for n = 1..1000</a>
%t A146077 Select[Range[400],GCD[#,2^#-2]!=FactorInteger[#][[1,1]]&] (* _Harvey P. Dale_, Dec 14 2015 *)
%Y A146077 Cf. A159353, A032742.
%K A146077 nonn
%O A146077 1,1
%A A146077 _Ray Chandler_, Apr 11 2009
%E A146077 Extended by _Ray Chandler_, Apr 11 2009