A181458 -id:A181458 - cp's OEIS frontend

A223701 Irregular triangle of numbers k such that prime(n) is the largest prime factor of k^2 - 1.

3, 2, 5, 7, 17, 4, 9, 11, 19, 26, 31, 49, 161, 6, 8, 13, 15, 29, 41, 55, 71, 97, 99, 127, 244, 251, 449, 4801, 8749, 10, 21, 23, 34, 43, 65, 76, 89, 109, 111, 197, 199, 241, 351, 485, 769, 881, 1079, 6049, 19601, 12, 14, 25, 27, 51, 53, 64, 79, 129, 131, 155

Offset: 1

T. D. Noe, Apr 03 2013

Note that the first number of each row forms the sequence 3, 2, 4, 6, 10, 12,..., which is A039915. The first 25 rows, except the first, are in A181447-A181470.

			Irregular triangle:
  {3},
  {2, 5, 7, 17},
  {4, 9, 11, 19, 26, 31, 49, 161},
  {6, 8, 13, 15, 29, 41, 55, 71, 97, 99, 127, 244, 251, 449, 4801, 8749}

Andrew Howroyd, Table of n, a(n) for n = 1..16223 (first 25 rows for primes up to 97)
Florian Luca and Filip Najman, On the largest prime factor of x^2-1, arXiv:1005.1533 [math.NT], 2010.
Florian Luca and Filip Najman, On the largest prime factor of x^2-1, Mathematics of Computation 80 (2011), 429-435. (Paper has errata that was posted on the MOC website.)
Filip Najman, List of Publications Page (Adjacent to entry number 4 are links with the data files for the first 25 rows (=16223 terms) of this sequence)

Rows 2..25 with complete data are: A181447, A181448, A181449, A181450, A181451, A181452, A181453, A181454, A181455, A181456, A181457, A181458, A181459, A181460, A181461, A181462, A181463, A181464, A181465, A181466, A181467, A181468, A181469, A181470.
Row 26 is A181568.
Cf. A039915 (first terms), A175607 (last terms), A181471 (row lengths), A379344 (row sums).
Cf. A223702, A223703, A223704 (related tables).

t = Table[FactorInteger[n^2 - 1][[-1,1]], {n, 2, 10^5}]; Table[1 + Flatten[Position[t, Prime[n]]], {n, 6}]

A181457 Numbers k such that 37 is the largest prime factor of k^2 - 1.

Original entry on oeis.org

36, 38, 73, 75, 149, 186, 221, 223, 260, 295, 369, 371, 406, 443, 482, 519, 593, 628, 776, 813, 815, 961, 1000, 1072, 1259, 1331, 1333, 1405, 1407, 1444, 1481, 1701, 1814, 1849, 1886, 1923, 1999, 2071, 2367, 2591, 2663, 2737, 2887, 2959, 3329, 3331, 3403

Offset: 1

Artur Jasinski, Oct 21 2010

Numbers k such that A076605(k) = 37.
Sequence is finite, for proof see A175607.
Search for terms can be restricted to the range from 2 to A175607(12) = 9447152318; primepi(37) = 12.

Artur Jasinski, Table of n, a(n) for n = 1..208

Cf. A076605, A175607, A181447-A181456, A181458-A181470, A181568.

[ n: n in [2..300000] | m eq 37 where m is D[#D] where D is PrimeDivisors(n^2-1) ]; // Klaus Brockhaus, Feb 19 2011

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 37 where D is PrimeDivisors(n^2-1)) ]; // Klaus Brockhaus, Feb 20 2011

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 == 37, AppendTo[rr, n]]]; n++ ]; rr (* Artur Jasinski *)
Select[Range[300000], FactorInteger[#^2-1][[-1, 1]]==37&]

is(n)=n=n^2-1; forprime(p=2, 31, n/=p^valuation(n, p)); n>1 && 37^valuation(n, 37)==n \\ Charles R Greathouse IV, Jul 01 2013

A181459 Numbers k such that 43 is the largest prime factor of k^2 - 1.

Original entry on oeis.org

42, 44, 85, 87, 171, 173, 216, 257, 259, 300, 343, 386, 431, 474, 517, 560, 601, 687, 689, 730, 818, 859, 1074, 1117, 1119, 1289, 1291, 1332, 1420, 1549, 1633, 1721, 1805, 1891, 1977, 1979, 2108, 2321, 2495, 2665, 2667, 2751, 2753, 2794, 2925, 3095, 3484

Offset: 1

Artur Jasinski, Oct 21 2010

Numbers k such that A076605(k) = 43.
Sequence is finite, for proof see A175607.
Search for terms can be restricted to the range from 2 to A175607(14) = 842277599279; primepi(43) = 14.

Artur Jasinski, Table of n, a(n) for n = 1..343

Cf. A076605, A175607, A181447-A181458, A181460-A181470, A181568.

[ n: n in [2..300000] | m eq 43 where m is D[#D] where D is PrimeDivisors(n^2-1) ]; // Klaus Brockhaus, Feb 19 2011

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 43 where D is PrimeDivisors(n^2-1)) ]; // Klaus Brockhaus, Feb 20 2011

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 == 43, AppendTo[rr, n]]]; n++ ]; rr (* Artur Jasinski *)
Select[Range[300000], FactorInteger[#^2-1][[-1, 1]]==43&]

is(n)=n=n^2-1; forprime(p=2, 41, n/=p^valuation(n, p)); n>1 && 43^valuation(n, 43)==n \\ Charles R Greathouse IV, Jul 01 2013

cp's OEIS Frontend

A223701 Irregular triangle of numbers k such that prime(n) is the largest prime factor of k^2 - 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A181457 Numbers k such that 37 is the largest prime factor of k^2 - 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Mathematica

PARI

A181459 Numbers k such that 43 is the largest prime factor of k^2 - 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Magma

Mathematica

PARI