A287352 -id:A287352 - cp's OEIS frontend

A384009 Irregular triangle read by rows where row n lists the positive first differences of the prime indices of n.

1, 2, 1, 3, 1, 1, 2, 2, 4, 1, 5, 3, 1, 1, 3, 6, 1, 1, 7, 4, 2, 1, 2, 4, 1, 8, 1, 2, 5, 5, 1, 2, 3, 6, 9, 1, 1, 10, 2, 3, 1, 3, 6, 7, 2, 1, 1, 11, 1, 7, 1, 1, 4, 2, 12, 1, 2, 4, 13, 8, 4, 1, 1, 2, 8, 9, 14, 5, 1, 3, 3, 2, 1, 5, 5, 1, 1, 15, 1, 2, 2, 10, 3, 1, 6, 6

Offset: 1

Gus Wiseman, May 23 2025

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The prime indices of 60 are {1,1,2,3}, differences (0,1,1), positive (1,1).
Rows begin:
     1: ()     16: ()       31: ()       46: (8)
     2: ()     17: ()       32: ()       47: ()
     3: ()     18: (1)      33: (3)      48: (1)
     4: ()     19: ()       34: (6)      49: ()
     5: ()     20: (2)      35: (1)      50: (2)
     6: (1)    21: (2)      36: (1)      51: (5)
     7: ()     22: (4)      37: ()       52: (5)
     8: ()     23: ()       38: (7)      53: ()
     9: ()     24: (1)      39: (4)      54: (1)
    10: (2)    25: ()       40: (2)      55: (2)
    11: ()     26: (5)      41: ()       56: (3)
    12: (1)    27: ()       42: (1,2)    57: (6)
    13: ()     28: (3)      43: ()       58: (9)
    14: (3)    29: ()       44: (4)      59: ()
    15: (1)    30: (1,1)    45: (1)      60: (1,1)

Row-lengths are A001221(n) - 1, sums A243055.
For multiplicities instead of differences we have A124010 (prime signature).
Positions of non-strict rows are a subset of A325992.
Including difference 0 gives A355536, 0-prepended A287352.
The 0-prepended version is A383534.
A000040 lists the primes, differences A001223.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
Cf. A039956, A048767, A055396, A061395, A130091, A320348, A325325, A325349, A325368, A358137, A381431.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[DeleteCases[Differences[prix[n]],0],{n,100}]

A294925 a(n) is the smallest number k with n prime factors such that p + k/p is prime for every prime p | k.

Original entry on oeis.org

2, 6, 30, 210, 15810, 292110, 16893030, 984016110, 17088913842, 2446241358990, 1098013758964122

Offset: 1

Thomas Ordowski, Nov 11 2017

Such k is an even squarefree number.

Conjecture: the sequence is infinite.

			a(2) = 6 because k = 2*3 = 6 is the smallest number with 2 prime factors such that 2 + 6/2 = 3 + 6/3 = 5 is prime.
From _Michael De Vlieger_, Nov 13 2017: (Start)
First differences of prime indices of a(n):
   n              a(n)  A287352(a(n))
  ----------------------------------------------------------
   1                2   1
   2                6   1, 1
   3               30   1, 1, 1,
   4              210   1, 1, 1, 1
   5            15810   1, 1, 1, 4, 4
   6           292110   1, 1, 1, 1, 2, 22
   7         16893030   1, 1, 1, 1, 1, 15, 7
   8        984016110   1, 1, 1, 1, 1,  5, 2, 66
   9      17088913842   1, 1, 2, 1, 1,  1, 1,  1, 67
  10    2446241358990   1, 1, 1, 2, 1,  2, 2,  3,  1, 93
  11 1098013758964122   1, 1, 2, 1, 1,  3, 2,  8,  3, 22, 10
(End)

Cf. A293756.

isok(k, n) = {if (!issquarefree(k), return (0)); if (omega(k) != n, return (0)); fordiv(k, d, if (isprime(d) && !isprime(d+k/d), return(0));); return (1);}
a(n) = {my(k=1); while( !isok(k, n), k++); k;} \\ Michel Marcus, Nov 11 2017

a(5)-a(7) from Michel Marcus, Nov 11 2017
a(8) from Michel Marcus, Nov 12 2017
a(9)-a(10) from Michael De Vlieger, Nov 13 2017
a(11) (and update of table in Example section) from Jon E. Schoenfield, Nov 19 2017

A358171 The a(n)-th composition in standard order (A066099) is the first differences plus one of the prime indices of n (A112798).

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 3, 1, 4, 0, 6, 0, 8, 2, 7, 0, 5, 0, 12, 4, 16, 0, 14, 1, 32, 3, 24, 0, 10, 0, 15, 8, 64, 2, 13, 0, 128, 16, 28, 0, 20, 0, 48, 6, 256, 0, 30, 1, 9, 32, 96, 0, 11, 4, 56, 64, 512, 0, 26, 0, 1024, 12, 31, 8, 40, 0, 192, 128, 18, 0, 29, 0

Offset: 1

Gus Wiseman, Dec 21 2022

nonn

The k-th composition in standard order (graded reverse-lexicographic, A066099) is obtained by taking the set of positions of 1's in the reversed binary expansion of k, prepending 0, taking first differences, and reversing again. This gives a bijective correspondence between nonnegative integers and integer compositions.

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

			The prime indices of 36 are {1,1,2,2}, with first differences plus one (1,2,1), which is the 13th composition in standard order, so a(36) = 13.

Gus Wiseman, Statistics, classes, and transformations of standard compositions

See link for sequences related to standard compositions.
Prepend 1 to indices: A253566 (cf. A358169), inverse A253565 (cf. A242628).
Taking Heinz number instead of standard composition number gives A325352.
These compositions minus one are listed by A355536, sums A243055.
A001222 counts prime indices, distinct A001221.
A066099 lists standard compositions, lengths A000120, sums A070939.
A112798 lists prime indices, sum A056239.
A355534 = augmented diffs. of rev. prime indices, Heinz numbers A325351.
Cf. A000720, A005940, A055932, A057335, A066312, A286470, A287352, A325390.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
stcinv[q_]:=Total[2^(Accumulate[Reverse[q]])]/2;
Table[stcinv[Differences[primeMS[n]]+1],{n,100}]

A287692 Triangle read by rows: T(n,k) is the greatest difference between prime factors among squarefree numbers A002110(n) <= m <= (A002110(n+1)-1) such that A001221(m) = n and m is divisible by A002110(k).

Original entry on oeis.org

3, 2, 5, 2, 3, 9, 2, 3, 5, 18, 2, 2, 4, 7, 30, 2, 2, 3, 5, 10, 42, 2, 2, 3, 4, 6, 13, 60, 2, 2, 3, 4, 5, 8, 17, 77, 2, 2, 3, 3, 4, 6, 10, 22, 113, 2, 2, 2, 3, 4, 5, 8, 12, 25, 145, 2, 2, 2, 3, 4, 5, 6, 9, 15, 32, 179, 2, 2, 2, 3, 4, 4, 6, 7, 11, 19, 36, 229

Offset: 1

Michael De Vlieger, Jun 15 2017

Let p_n# = A002110(n).
T(n,1) is the greatest index of the smallest prime divisor p of terms m in row n.
T(n,n) = A120941(n).
Consider the use of A287352 as a method for formulating squarefree numbers with n distinct prime factors. The values in row n serve as a limit beyond which we need not search further for terms p_n# <= m <= (p_(n+1)# - 1). A287352 defines a squarefree number using a sequence of nonzero positive terms, beginning with the index of the smallest prime factor, then listing differences between indexes of subsequent prime factors in order of their magnitude. We can direct increment to the largest prime index as long as the number m < p_(n+1), then increment the index before it, etc. to produce the entire tree of factors that code numbers m.

			Triangle begins:
  n\k|  1   2   3   4   5   6   7   8    9   10   11   12
---------------------------------------------------------
   1 |  3
   2 |  2   5
   3 |  2   3   9
   4 |  2   3   5  18
   5 |  2   2   4   7  30
   6 |  2   2   3   5  10  42
   7 |  2   2   3   4   6  13  60
   8 |  2   2   3   4   5   8  17  77
   9 |  2   2   3   3   4   6  10  22  113
  10 |  2   2   2   3   4   5   8  12   25  145
  11 |  2   2   2   3   4   5   6   9   15   32  179
  12 |  2   2   2   3   4   4   6   7   11   19   36  229
  ...
Let p_n# = A002110(n). For n = 2, there are A287484(2) = 7 squarefree numbers p_2# <= m <= (p_3# - 1) such that omega(m) = n. These are {6, 10, 14, 22, 26, 15, 21}. These numbers m have A287352(m) = {{1,1}, {1,2}, {1,3}, {1,4}, {1,5}, {2,1}, {2,2}} respectively; the largest values in both positions are {2,5}, thus row n = 2 of a(n) is {2,5}.

Cf. A001221, A002110, A120941, A287483, A287484, A287691.

f[n_] := If[n == 0, {{1}}, Block[{P = Product[Prime@ i, {i, n}], lim, k = 1, c, w = ConstantArray[1, n]}, lim = Prime[n + 1] P; {w}~Join~Reap[Do[w = If[k == 1, MapAt[# + 1 &, w, -k], Join[Drop[MapAt[# + 1 &, w, -k], -k + 1], ConstantArray[1, k - 1]]]; c = Times @@ Map[If[# == 0, 1, Prime@ #] &, Accumulate@ w]; If[c < lim, Sow[w]; k = 1, If[k == n, Break[], k++]], {i, Infinity}] ][[-1, 1]] ] ]; Table[Max /@ Transpose@ f@ n, {n, 14}] // Flatten (* Michael De Vlieger, Jun 15 2017 *)

cp's OEIS Frontend

A384009 Irregular triangle read by rows where row n lists the positive first differences of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A294925 a(n) is the smallest number k with n prime factors such that p + k/p is prime for every prime p | k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Extensions

A358171 The a(n)-th composition in standard order (A066099) is the first differences plus one of the prime indices of n (A112798).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A287692 Triangle read by rows: T(n,k) is the greatest difference between prime factors among squarefree numbers A002110(n) <= m <= (A002110(n+1)-1) such that A001221(m) = n and m is divisible by A002110(k).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica