A046363 -id:A046363 - cp's OEIS frontend

A144585 Composites whose sum of prime factors is an odd nonprime (counted with multiplicity).

14, 20, 24, 26, 27, 38, 44, 46, 62, 68, 74, 86, 92, 94, 105, 106, 112, 116, 122, 124, 125, 126, 134, 146, 150, 152, 158, 160, 164, 166, 171, 178, 180, 188, 192, 194, 195, 206, 208, 212, 216, 218, 226, 231, 232, 234, 236, 243, 244, 254, 255, 261, 262, 272, 275

Offset: 1

Juri-Stepan Gerasimov, Jan 04 2009

nonn

			14 is a term because 14 = 2*7 and 2+7 = 9 (an odd nonprime);
20 is a term because 20 = 2*2*5 and 2+2+5 = 9,
24 is a term because 24 = 2*2*2*3 and 2+2+2+3 = 9;
26 is a term because 26 = 2*13 and 2+13 = 15 (also an odd nonprime).

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A002808, A036349, A046363, A141468.

Includes A030078(k) for k > 1.

ifac := proc (n) local L, x: L := ifactors(n)[2]: map(proc (x) options operator, arrow: seq(x[1], j = 1 .. x[2]) end proc, L) end proc: a := proc (n) local b: b := add(ifac(n)[j], j = 1 .. nops(ifac(n))): if isprime(n) = false and `mod`(b, 2) = 1 and isprime(b) = false then n else end if end proc: seq(a(n), n = 1 .. 280); # Emeric Deutsch, Jan 27 2009

Corrected (removed 81; added 126, 158) and extended by Emeric Deutsch, Jan 27 2009

Example section edited by Jon E. Schoenfield, Jan 15 2019

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.

A358490 Composite Fibonacci numbers whose sum of prime factors (with multiplicity) is a prime.

Original entry on oeis.org

34, 75025, 196418, 701408733, 225851433717, 591286729879, 23416728348467685, 420196140727489673, 927372692193078999176, 16641027750620563662096, 114059301025943970552219, 1264937032042997393488322, 5358359254990966640871840, 2353412818241252672952597492098, 3807901929474025356630904134051

Offset: 1

Marc Kouyoumdjian, Nov 18 2022

nonn

			75025 is a term because it is a composite Fibonacci number whose sum of prime factors 5, 5 and 3001 is 3011, a prime number.

Shyam Sunder Gupta, Prime Curios! 34

Intersection of A000045 and A046363.
Intersection of A090206 and A100118.
Cf. A001414.

cp's OEIS Frontend

A144585 Composites whose sum of prime factors is an odd nonprime (counted with multiplicity).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Extensions

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

A358490 Composite Fibonacci numbers whose sum of prime factors (with multiplicity) is a prime.

Views

Author

Keywords

Examples

Links

Crossrefs