A080195 -id:A080195 - cp's OEIS frontend

A125624 Array read by antidiagonals: n-th row contains the positive integers with their largest prime factor equal to the n-th prime.

2, 3, 4, 5, 6, 8, 7, 10, 9, 16, 11, 14, 15, 12, 32, 13, 22, 21, 20, 18, 64, 17, 26, 33, 28, 25, 24, 128, 19, 34, 39, 44, 35, 30, 27, 256, 23, 38, 51, 52, 55, 42, 40, 36, 512, 29, 46, 57, 68, 65, 66, 49, 45, 48, 1024, 31, 58, 69, 76, 85, 78, 77, 56, 50, 54, 2048, 37, 62, 87, 92

Offset: 1

Leroy Quet, Jan 27 2007

This sequence is a permutation of the integers >= 2.
Since the table has been entered by rising instead of falling antidiagonals, the sequence represents the transpose, with columns instead of rows: cf. the "table" link, section "infinite square array". - M. F. Hasler, Oct 22 2019
Start with table headed by primes in the first row, then list beneath each prime(k) the ordered prime(k)-smooth numbers. Read the table by falling antidiagonals to get the terms of this sequence. - David James Sycamore, Jun 23 2024

			Array begins: (rows here appear as columns in the "table" display of the sequence)
   2,  4,  8, 16, 32, 64, 128, 256, 512, ... (A000079)
   3,  6,  9, 12, 18, 24,  27,  36,  48, ... (A065119)
   5, 10, 15, 20, 25, 30,  40,  45,  50, ... (A080193)
   7, 14, 21, 28, 35, 42,  49,  56,  63, ... (A080194)
  11, 22, 33, 44, 55, 66,  77,  88,  99, ... (A080195)
  13, 26, 39, 52, 65, 78,  91, 104, 117, ... (A080196)
The 3rd row, for example, contains the positive integers where the 3rd prime, 5, is the largest prime divisor. That is, each integer in this row is divisible by 5 and may be divisible by 2 or 3 as well, but none of the integers in this row are divisible by primes larger than 5. (So for example, 35 = 5*7 is excluded from the 3rd row.)

Ivan Neretin, Table of n, a(n) for n = 1..5050

Cf. A083140, A006530, A000040 (1st col), A033286 (main diag), A077320.

Cf. A000079, A003586, A051037, A002473, A051038, A080197, A080681.

lpf[n_] := FactorInteger[n][[ -1, 1]];f[n_, m_] := f[n, m] = Block[{k},k = If[m == 1, Prime[n], f[n, m - 1] + 1];While[lpf[k] != Prime[n], k++ ];k];Table[f[ d - m + 1, m], {d, 12}, {m, d}] // Flatten (* Ray Chandler, Feb 09 2007 *)

T=List(); r=c=1; for(n=1,99, #TT[r][1], ); print1(T[r][c]","); r-- && c++ || r=c+c=1) \\ M. F. Hasler, Oct 22 2019

Extended by Ray Chandler, Feb 09 2007

A080187 Primes p such that 11 is the largest of all prime factors of the numbers between p and the next prime (cf. A052248).

Original entry on oeis.org

19, 97, 197, 461, 659, 1319, 1451, 2111, 2309, 2969, 3167, 3299, 4157, 5279, 7127, 9239, 10889, 11549, 15971, 16631, 22637, 25409, 26729, 29567, 30491, 34649, 34847, 55439, 55901, 64151, 87119, 92399, 98009, 110879, 118799, 152459, 164999, 176417

Offset: 1

Klaus Brockhaus, Feb 10 2003

nonn

The sequence appears to consist of 19, 97 and the lesser of twin primes q (A001359) such that q+1 is 11-smooth (A051038) but not 7-smooth (A002473, A080195).

			97 is a term since 98 = 2*7^2, 99 = 3^2*11, 100 = 2^2*5^2 are the numbers between 97 and the next prime 101;
461 is a term since 462 = 2*3*7*11 is the only number between 461 and the next prime 463.

Amiram Eldar, Table of n, a(n) for n = 1..521 (terms below 10^11)

Cf. A052248, A001359, A051038, A002473, A080195.

maxPrime[n1_, n2_] := FactorInteger[#][[-1, 1]] & /@ Range[n1, n2]; Select[Range[180000], PrimeQ[#] && Max[maxPrime[# + 1, NextPrime[#] - 1]] == 11 &] (* Amiram Eldar, Feb 08 2020 *)

{forprime(p=2,180000,q=nextprime(p+1); m=0; j=p+1; while(j

cp's OEIS Frontend

A125624 Array read by antidiagonals: n-th row contains the positive integers with their largest prime factor equal to the n-th prime.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions