A292081 -id:A292081 - cp's OEIS frontend

A297150 Let b(k) denote A292081(k); the sequence lists numbers b(2n) where for all m > n, b(2m) > b(2n).

35, 65, 95, 115, 155, 185, 215, 235, 265, 305, 335, 365, 395, 415, 445, 485, 515, 545, 565, 635, 655, 695, 755, 785, 815, 835, 865, 905, 965, 995, 1055, 1115, 1145, 1165, 1205, 1255, 1285, 1315, 1355, 1385, 1415, 1465, 1535, 1565, 1585, 1655, 1685, 1745, 1765, 1795, 1835, 1865, 1895, 1915, 1945, 1985

Offset: 1

David James Sycamore, Dec 26 2017

nonn

This is also an ascending subsequence of the even-indexed terms of A056240(2n) (of which A292081 is a subsequence). For n >= 1, a(n) is a semiprime of the form a(n)=5*A049591(n), and the index m in A056240 of any term in this sequence belongs to the sequence of even numbers m such that m-5 is prime and m-3 is not prime (A297925). See A297925 for explanation.

			a(1)=5*A049591(1)=5*7=35. Also A056240(A297925(1))=A056240(12)=35.
a(17)=5*A049591(17)=5*103=515. Also A056240(A297925(17))=A056240(108)=515.

Vincenzo Librandi, Table of n, a(n) for n = 1..1690

Similar to A288313.

Cf. A292081, A288313, A056240, A049591, A297925.

[5*p: p in PrimesInInterval(3, 500) | not IsPrime(p + 2)]; // Vincenzo Librandi, Nov 12 2018

5 Select[Prime[Range[3, 100]], ! PrimeQ[(# + 2)] &] (* Vincenzo Librandi, Nov 12 2018 *)

a(n) = 5*A049591(n) = A056240(A297925(n)).

A295185 a(n) is the smallest composite number whose prime divisors (with multiplicity) sum to prime(n); n >= 3.

Original entry on oeis.org

6, 10, 28, 22, 52, 34, 76, 184, 58, 248, 148, 82, 172, 376, 424, 118, 488, 268, 142, 584, 316, 664, 1335, 388, 202, 412, 214, 436, 3729, 508, 1048, 274, 2919, 298, 1208, 1256, 652, 1336, 1384, 358, 3801, 382, 772, 394, 6501, 7385, 892, 454, 916, 1864, 478, 5061, 2008, 2056, 2104, 538, 2168, 1108, 562, 5943, 9669

Offset: 3

David James Sycamore, Nov 16 2017

nonn

Sequence is undefined for n=1,2 since no composites exist whose prime divisors sum to 2, 3. For n >= 3, a(n) = A288814(prime(n)) = prime(n-k)*B(prime(n) - prime(n-k)) where B=A056240, and k >= 1 is the "type" of prime(n), indicated as prime(n)~k(g1,g2,...,gk) where gi = prime(n-(i-1)) - prime(n-i); 1 <= i <= k. Thus: 5~1(2), 211~2(12,2), 4327~3(30,8,6) etc. The sequence relates to gaps between odd primes, and in particular to the sequence of k prime gaps below prime(n). The even-indexed terms of B are relevant, as are those of subsequences:
  C=A288313, 2,4 plus terms B(n) where n-3 is prime (A298252),
  D=A297150, terms B(n) where n-5 is prime and n-3 is composite (A297925) and
  E=A298615, terms B(n) where both n-3 and n-5 are composite (A298366).
  The above sequences of indices 2m form a partition of the even numbers and the corresponding terms B(2m) form a partition of the even-indexed terms of A056240. The union of D and E is the sequence A292081 = B-C.
Let g(n,t) = prime(n) - prime(n-t), t < n, and h(n,t) = g(n,t) - g(n,1), 1 < t < n. If g1=g(n,1) is a term in A298252 (g1-3 is prime), then B(g1) is a term in C, so k=1. If g1 belongs to A297925 or A298366 then B(g1) is a term in D or E and the value of k depends on subsequent gaps below prime(n), within a range dependent on g1.
Let range R1(g1) = u - g(n,1) where u is the index in B of the greatest term in C such that C(u) < B(g1). Let range R2(g1) = v-g(n,1) where v is the index in B of the greatest term in D such that D(v) <= B(g1). For all n, R2 < R1, and if g1 is a term in D then R2(g1)=0. Examples: R1(12)=2, R2(12)=0, R1(30)=26, R2(30)=6.
k >= 1 is the smallest integer such that B(g(n,k)) <= B(g(n,t)) for all t satisfying g1 <= g(n,t) <= g1 + R1(g1). For g1-3 prime, k=1. If g1-3 is composite, let z be least integer > 1 such that g(n,z)-3 is prime, and let w be least integer >= 1 such that g(n,w)-5 is prime. Then z "complies" if h(n,z) <= R1, and w "complies" if h(n,w) <= R2. If g1-5 is prime then R2=w=0 and only z is relevant.
B(g1) must belong to C,D or E. If in C (g1-3 is prime) then k=1. If in D (g1-5 is prime), k=z if z complies, otherwise k=1. If B(g1) is in E and z complies but not w then k=z, or if w complies but not z then k=w. If B(g1) is in E and z,w both comply then k=z if 3*(g(n,z)-3) < 5*(g(n,w)-5), otherwise k=w. If neither z nor w comply, then k=1.
Conjecture: For all n >= 3, a(n) >= A288189(n).

			5=prime(3), g(3,1)=5-3=2, a term in C; k=1, and a(3)=3*B(5-3)=3*2=6; 5~1(2).
17=prime(7), g(7,1)=17-13=4, a term in C; k=1, a(7)=13*B(17-13)=13*4=52; 17~1(4).
211=prime(47); g(47,1)=12, a term in D, R1=2, R2=0, k=z=2, a(47)=197*b(211-197)=197*33=6501; 211~2(12,2), and 211 is first prime of type k=2.
8923=prime(1109); g(1109,1)=30, a term in E. R1=26, R2=6, z=3 and w=2 both comply  but 3*(g(n,3)-3)=159 > 5*(g(n,2)-5)=155, so k=w=2. Therefore a(1109)=8887*b(8923-8887)=8887*b(36)=8887*155=1377485; 8923~2(30,6).
40343=prime(4232); g(4232,1)=54, a term in E. R1=58, R2=12,z=6 and w=3, both comply, 3*(g(n,z)-3)=309 and 5*(g(n,w)-5)=305 therefore k=w=3 and a(4232) = 40277*b(40343-40277)=40277*b(66)=40277*305=12284485; 40343~3(54,6,6).
81611=prime(7981); g(81611,1)=42, a term in D, R1=22, R2=0; z complies, k=z=6, a(7981)=81547*b(81611-81547)=81546*b(64)=81546*183=14923101; 81611~6(42,6,4,6,2,4) and is the first prime of type k=6.
If p is the greater of twin/cousin primes then p~1(2), p~1(4), respectively.

Giovanni Resta, Table of n, a(n) for n = 3..10000

Cf. A000040, A056240, A288814, A292081, A289993, A288313, A297150, A298615, A298252, A297925, A298366, A288189.

b[n_] := b[n] = Total[Times @@@ FactorInteger[n]];
a[n_] := For[k = 2, True, k++, If[CompositeQ[k], If[b[k] == Prime[n], Return[k]]]];
Table[a[n], {n, 3, 63}] (* Jean-François Alcover, Feb 23 2018 *)

a(n) = { my(p=prime(n)); forcomposite(x=6, , my(f=factor(x)); if(f[, 1]~*f[, 2]==p, return(x))); } \\ Iain Fox, Dec 08 2017

a(n) = A288814(prime(n)) = prime(n-k)*A056240(prime(n) - prime(n-k)) for some k >= 1 and prime(n-k) = gpf(A288814(prime(n)).

a(n) >= A288189(n).

A289993 Primes p such that gpf(A288814(p)) < q, where q is greatest prime < p.

Original entry on oeis.org

211, 541, 631, 673, 1693, 1801, 2879, 3181, 3271, 3299, 3343, 3571, 3943, 4177, 4327, 4441, 4547, 4561, 4751, 4783, 4813, 4861, 5147, 5261, 5381, 5431, 5501, 5779, 6029, 6197, 6421, 6469, 6521, 6599, 6673, 6883, 6947, 7103, 7283, 7321, 7369, 7477, 7573, 7603, 7789, 7901, 7963, 7993, 8419, 8443

Offset: 1

David James Sycamore, Sep 13 2017

For prime p in this sequence, b(p) = r*b(p-r) where b(m) = A288814(m), and r = gpf(b(p)) is some prime < q. We can say that prime p_n (n > 2) is of type k if gpf(b(p_n)) = p_(n-k).

Prime gap p-q, and pattern of gaps p-r determines if p is in the sequence or not. Prime p is of type k > 2 only if p-q is one of the even indices of A056240 on which A292081 is defined (12,18,24,28,30,36,...), and if there is a prime r < q < p such that b(p-r) < b(p-q).

			p=211 is a candidate for inclusion because p-q = 211-199 = 12, and b(12)=35 is a term in A292081. Since r=197 is the next prime below q, p-r = 14 and b(14) = 33 < 35, 211 is in the sequence, of type 2.
Conversely, p=809, which also has gap p-q = 12, is not in the sequence because the only number n > 12 for which b(n) < b(12)=35 is n=14, and p-14 = 795 is not prime. Therefore b(809) = 797*b(12) = 27895, and 809 is of type 1.

David A. Corneth, Table of n, a(n) for n = 1..31763 (terms up to 5*10^6; first 544 terms from Robert Israel)
David A. Corneth, PARI program.

Cf. A000040, A056240, A288814, A288313, A292081, A001223.

N:= 10^7: # to get terms before the first prime p>3 such that A288814(p) > N
Res:= NULL:
for x from 4 to N do
  if isprime(x) then next fi;
  F:= ifactors(x)[2];
  p:= add(t[1]*t[2],t=F);
  if not isprime(p) then next fi;
  if not assigned(A288814[p]) then
    A288814[p]:= x;
    w:= max(seq(t[1],t=F));
    if w < prevprime(p) then
      Res:= Res, p
    fi
  fi
od:
pmax:= Res[-1]:
Primes:= select(isprime, [seq(i,i=5..pmax,2)]):
B:= remove(p -> assigned(A288814[p]), Primes):
sort(select(`<`,[Res], min(B))); # Robert Israel, Oct 19 2017

\\ See PARI link. - David A. Corneth, Mar 23 2018

a(30)-a(50) from Robert Israel, Oct 02 2017

Edited by Michel Marcus, Nov 15 2023

A366841 Least positive integer whose odd prime factors sum to n, starting with n = 5.

Original entry on oeis.org

5, 9, 7, 15, 27, 21, 11, 35, 13, 33, 105, 39, 17, 65, 19, 51, 195, 57, 23, 95, 171, 69, 285, 115, 29, 161, 31, 87, 483, 93, 261, 155, 37, 217, 465, 111, 41, 185, 43, 123, 555, 129, 47, 215, 387, 141, 645, 235, 53, 329, 705, 159, 987, 265, 59, 371, 61, 177

Offset: 5

Gus Wiseman, Oct 27 2023

nonn

All terms are odd.

It seems that all composite terms not divisible by 3 form a supersequence of A292081. - Ivan N. Ianakiev, Oct 30 2023

			The terms together with their prime factors (which sum to n) begin:
    5 = 5
    9 = 3*3
    7 = 7
   15 = 3*5
   27 = 3*3*3
   21 = 3*7
   11 = 11
   35 = 5*7
   13 = 13
   33 = 3*11
  105 = 3*5*7

Michel Marcus, Table of n, a(n) for n = 5..1000

This is the odd case of A056240.
Positions of first appearances in A366840 (sum of odd prime factors).
The partition triangle for this statistic is A366851, even A116598.
A001414 adds up prime factors, triangle A331416.
A019507 lists numbers with (even factor sum) = (odd factor sum).
A027746 lists prime factors, length A001222.
A087436 counts odd prime factors, even A007814.
A366528 adds up odd prime indices, triangle A113685 (without zeros A365067).
Cf. A031368, A036349, A056239, A066208, A100005, A112798, A239261, A257991, A335657, A366839.

nn=1000;
w=Table[Total[Times@@@DeleteCases[If[n==1,{},FactorInteger[n]],{2,_}]],{n,nn}];
spnm[y_]:=Max@@Select[Union[y],Function[i,Union[Select[y,#<=i&]]==Range[i]]];
Table[Position[w,k][[1,1]],{k,5,spnm[Join[{1,2,3,4},Take[w,nn]/.(0->1)]]}]

f(n) = my(f=factor(n), j=if (n%2, 1, 2)); sum(i=j, #f~, f[i,1]*f[i,2]); \\ A366840
a(n) = my(k=1); while (f(k) != n, k++); k; \\ Michel Marcus, Nov 02 2023

cp's OEIS Frontend

A297150 Let b(k) denote A292081(k); the sequence lists numbers b(2n) where for all m > n, b(2m) > b(2n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A295185 a(n) is the smallest composite number whose prime divisors (with multiplicity) sum to prime(n); n >= 3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A289993 Primes p such that gpf(A288814(p)) < q, where q is greatest prime < p.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

PARI

Extensions

A366841 Least positive integer whose odd prime factors sum to n, starting with n = 5.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI