# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a181468
Showing 1-1 of 1

%I A181468 #14 Sep 08 2022 08:45:54
%S A181468 82,84,165,167,248,331,414,497,499,582,665,829,831,914,995,1080,1161,
%T A181468 1246,1327,1329,1495,1576,1825,1910,2076,2157,2159,2323,2406,2408,
%U A181468 2738,2821,2906,2989,3070,3238,3319,3485,3568,3651,3653,3817,4149,4234,4481
%N A181468 Numbers n such that 83 is the largest prime factor of n^2-1.
%C A181468 Sequence is finite, for proof see A175607.
%C A181468 Search for terms can be restricted to the range from 2 to A175607(23) = 34903240221563713; primepi(83) = 23.
%H A181468 A. Jasinski, <a href="/A181468/b181468.txt">Table of n, a(n) for n = 1..2082</a>
%t A181468 jj = 2^36*3^23*5^15*7^13*11^10*13^9*17^8*19^8*23^8*29^7*31^7*37^7*41^6 *43^6*47^6*53^6*59^6*61^6*67^6*71^5*73^5*79^5*83^5*89^5*97^5; rr = {}; n = 2; While[n < 3222617400, If[GCD[jj, n^2 - 1] == n^2 - 1, k = FactorInteger[n^2 - 1]; kk = Last[k][[1]]; If[kk == 83, AppendTo[rr, n]]]; n++ ]; rr (* _Artur Jasinski_ *)
%t A181468 Select[Range[300000], FactorInteger[#^2-1][[-1, 1]]==83&]
%o A181468 (Magma) [ n: n in [2..300000] | m eq 83 where m is D[#D] where D is PrimeDivisors(n^2-1) ]; // _Klaus Brockhaus_, Feb 21 2011
%o A181468 (Magma) p:=(97*89*83*79*73*71)^5 *(67*61*59*53*47*43*41)^6 *(37*31*29)^7 *(23*19*17)^8 *13^9 *11^10 *7^13 *5^15 *3^23 *2^36; [ n: n in [2..50000000] | p mod (n^2-1) eq 0 and (D[#D] eq 83 where D is PrimeDivisors(n^2-1)) ]; // _Klaus Brockhaus_, Feb 21 2011
%o A181468 (PARI) is(n)=n=n^2-1; forprime(p=2, 79, n/=p^valuation(n, p)); n>1 && 83^valuation(n, 83)==n \\ _Charles R Greathouse IV_, Jul 01 2013
%Y A181468 Cf. A175607, A181447-A181467, A181469-A181470, A181568.
%K A181468 fini,nonn
%O A181468 1,1
%A A181468 _Artur Jasinski_, Oct 21 2010

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE