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.
%I A181463 #18 Dec 20 2024 17:40:58
%S A181463 60,62,121,123,184,243,245,365,367,426,428,487,489,550,609,611,794,
%T A181463 1036,1099,1160,1219,1221,1343,1463,1585,1646,1709,1768,1770,1951,
%U A181463 2014,2073,2256,2319,2439,2441,2500,2561,2624,2807,2927,3173,3537,3539,3659,3781
%N A181463 Numbers k such that 61 is the largest prime factor of k^2-1.
%C A181463 Numbers k such that A076605(k) = 61.
%C A181463 Sequence is finite, for proof see A175607.
%C A181463 Search for terms can be restricted to the range from 2 to A175607(18) = 63774701665793; primepi(61) = 18.
%H A181463 Artur Jasinski, <a href="/A181463/b181463.txt">Table of n, a(n) for n = 1..799</a>
%t A181463 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 < 14000000, If[GCD[jj, n^2 - 1] == n^2 - 1, k = FactorInteger[n^2 - 1]; kk = Last[k][[1]]; If[kk == 61, AppendTo[rr, n]]]; n++ ]; rr (* _Artur Jasinski_ *)
%t A181463 Select[Range[300000], FactorInteger[#^2-1][[-1, 1]]==61&]
%o A181463 (Magma) [ n: n in [2..300000] | m eq 61 where m is D[#D] where D is PrimeDivisors(n^2-1) ]; // _Klaus Brockhaus_, Feb 19 2011
%o A181463 (PARI) is(n)=n=n^2-1; forprime(p=2, 59, n/=p^valuation(n, p)); n>1 && 61^valuation(n, 61)==n \\ _Charles R Greathouse IV_, Jul 01 2013
%Y A181463 Cf. A076605, A175607, A181447-A181462, A181464-A181470, A181568.
%K A181463 fini,full,nonn
%O A181463 1,1
%A A181463 _Artur Jasinski_, Oct 21 2010