A064364 -id:A064364 - cp's OEIS frontend

A349543 a(n) = A001414(A277272(n)).

2, 4, 6, 3, 6, 9, 9, 9, 15, 5, 5, 10, 8, 8, 8, 10, 10, 10, 14, 7, 7, 7, 21, 9, 12, 10, 16, 12, 15, 25, 20, 14, 12, 16, 22, 11, 11, 11, 11, 11, 11, 33, 12, 12, 18, 16, 26, 13, 13, 13, 13, 39, 21, 14, 12, 18, 18, 12, 14, 22, 32, 20, 45, 27, 24, 34, 17, 17, 17, 17

Offset: 1

Michael De Vlieger, Nov 21 2021

nonn

Although terms k in A277272 are distinct, terms m in this sequence may appear A000607(m) times, even consecutively.
The restriction of the number of appearances of m to A000607(m) is a consequence of distinct k such that A001414(k) = m. Distinct k for which A001414(k) = m relates to the number of prime partitions of m and are listed in row m of A064364. For example, k in {7, 10, 12} have A001414(k) = 7. Once these k have appeared in A277272, there is no other way to obtain m = 7 in this sequence. Hence m = 7 is exhausted in this sequence.
Terms are greater than 1.

Michael De Vlieger, Table of n, a(n) for n = 1..10001
Michael De Vlieger, Log log scatterplot of a(n) for n=1..2^17, accentuating n <= 2^10 with small points, and n <= 32 with medium points for better visibility.

Cf. A000607, A001414, A064364, A277272.

m = 2, n = 1, s[] = c[] = 0; s[2] = 2; c[2]++; {2}~Join~Reap[Do[k = 3; While[Nand[GCD[If[s[k] == 0, Set[s[k], Total@ Flatten[ConstantArray[#1, #2] & @@@ FactorInteger[k]]], s[k]], s[m]] > 1, c[k] == 0], k++]; Set[n, k]; Sow[s[k]]; c[n]++; m = n, 70]][[-1, -1]]

A354547 Least number k <= n such that sopfr(k) = sopfr(n).

Original entry on oeis.org

1, 2, 3, 4, 5, 5, 7, 8, 8, 7, 11, 7, 13, 14, 15, 15, 17, 15, 19, 14, 21, 13, 23, 14, 21, 26, 14, 11, 29, 21, 31, 21, 33, 19, 35, 21, 37, 38, 39, 11, 41, 35, 43, 26, 11, 46, 47, 11, 33, 35, 51, 17, 53, 11, 39, 13, 57, 31, 59, 35, 61, 62, 13, 35, 65, 39, 67, 38

Offset: 1

Jean-Marc Rebert, Aug 15 2022

nonn

			For n = 16 = 2^4, sopfr(16) = 2*4 = 8 and 15 = 3 * 5, sopfr(15)= 3 + 5 = 8 and for k < 15, sopfr(k) != 8, hence a(16) = 15.

Michael De Vlieger, Table of n, a(n) for n = 1..10000

Cf. A001414 (sopfr), A056240, A064364.

f[n_] := Plus @@ Times @@@ FactorInteger[n]; f[1] = 0; m = 100; With[{s = Array[f, m]}, Table[FirstPosition[s, s[[n]]][[1]], {n, 1, m}]] (* Amiram Eldar, Aug 15 2022 *)

sopfr(n) = (n=factor(n))[, 1]~*n[, 2]; \\ A001414
a(n) = my(s=sopfr(n), k=1); while (sopfr(k) != s, k++); k; \\ Michel Marcus, Aug 16 2022

A376511 a(1) = 2. For n > 1, if a(n-1) is a novel term, a(n)=A001414(a(n-1)), else if there are k (>1) occurrences of a(j) = a(n-1) (1<=j<=n-1), a(n) is the smallest novel m such that A001414(m) = k*a(n-1).

Original entry on oeis.org

2, 2, 4, 4, 15, 8, 6, 5, 5, 21, 10, 7, 7, 33, 14, 9, 6, 35, 12, 7, 38, 21, 185, 42, 12, 95, 24, 9, 65, 18, 8, 39, 16, 8, 114, 24, 215, 48, 11, 11, 57, 22, 13, 13, 69, 26, 15, 161, 30, 10, 51, 20, 9, 92, 27, 9, 155, 36, 10, 209, 30, 371, 60, 12, 186, 36, 335, 72

Offset: 1

David James Sycamore, Sep 25 2024

nonn

Sequence inspired by a revisit to A353125. a(n) is a novel prime p iff a(n-1) is a term in A046363, following which a(n+1) is also = p. The first occurrences of 4 or p are followed by 4 or p respectively (4 being the only composite m such that Sopfr(m)=m), and these are the only terms repeated contiguously in this sequence. 3 cannot be a term because it is not given, and there is no composite g such that Sopfr(g)=3. A string of descending composite terms follows primes p,p until reaching (i) a repeat of an earlier term, or (ii) a term in A046363 (which produces a new prime pair q,q). If (i) the sequence resets immediately to a new string of descending composite terms, and if (ii) the reset occurs after the next pair q,q of primes. Every positive integer m (other than 3) occurs a maximum of A000607(m) times, this being the number of numbers k such that Sopfr(k)=m.

Row n of table T(n,k) in A064364 lists numbers j such that A001414(j) = n, with T(n,1) = A056240(n), and every term in this sequence is taken from the appropriate row of A064364. When a(n-1) is a novel term a(n) = A001414(a(n-1)), which is defined. Otherwise a(n) = smallest m such that A001414(m) = k*a(n-1), a number which is also defined since it is the smallest unused term in T(k*a(n-1),k) of A064364. Therefore the sequence is well defined and infinite. Conjecture: For any n > 1 every term in T(n,k) of A064364 appears eventually.

			a(1) = 2 is given, then since 2 is a novel term, a(2) = A001414(2) = 2. 2 has now been seen k = 2 times so a(3) is the smallest novel m such that A001414(m) = 2*2 = 4, so a(3) = 4, a novel term meaning that a(4) = A001414(4) = 4. now 4 has been seen twice so a(5) is the smallest novel m such that A001414(m) = 2*4 = 8, so a(5) = 15.

Michael De Vlieger, Table of n, a(n) for n = 1..5000
Michael De Vlieger, Log log scatterplot of a(n), n = 1..5000, showing primes in red, perfect powers of primes in gold, squarefree composites in green, and numbers neither squarefree nor prime powers in blue and purple, with purple additionally representing powerful numbers that are not prime powers. Primes first appear in pairs.

Cf. A000040, A000607, A000792, A001414, A046363, A056240, A064364, A353125, A376147.

nn = 120; c[_] := 0; j = a[1] = 2; u = 2;
f[x_] := f[x] = Total@ Flatten[ConstantArray[#1, #2] & @@@ FactorInteger[x]];
s = PositionIndex@ Array[f, 2^16];
Do[If[Set[m, c[j]] == 0, Set[k, f[j]],
  Set[{k, t, w}, {1, #, Length[#]}] &@Lookup[s, (m + 1)*j];
  While[c[t[[k]]] > 0, k++]; k = t[[k]] ]; c[j]++;
  Set[{a[i], j}, {k, k}], {i, 2, nn}];
Array[a, nn] (* Michael De Vlieger, Sep 27 2024 *)

If a(k) = first occasion of prime p, a(k+1) = p, a(k+2) = A056240(2*p), a(k+3) = 2*p.

cp's OEIS Frontend

A349543 a(n) = A001414(A277272(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

A354547 Least number k <= n such that sopfr(k) = sopfr(n).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A376511 a(1) = 2. For n > 1, if a(n-1) is a novel term, a(n)=A001414(a(n-1)), else if there are k (>1) occurrences of a(j) = a(n-1) (1<=j<=n-1), a(n) is the smallest novel m such that A001414(m) = k*a(n-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A195666 Numbers whose sum of prime factors is 17.

Views

Author

Keywords

Comments

Programs

Mathematica