A100484 -id:A100484 - cp's OEIS frontend

A339115 Greatest semiprime whose prime indices sum to n.

4, 6, 10, 15, 25, 35, 55, 77, 121, 143, 187, 221, 289, 323, 391, 493, 551, 667, 841, 899, 1073, 1189, 1369, 1517, 1681, 1763, 1961, 2183, 2419, 2537, 2809, 3127, 3481, 3599, 3953, 4189, 4489, 4757, 5041, 5293, 5723, 5963, 6499, 6887, 7171, 7663, 8051, 8633

Offset: 2

Gus Wiseman, Nov 28 2020

nonn

A semiprime is a product of any two prime numbers. A prime index of n is a number m such that the m-th prime number divides n. The multiset of prime indices of n is row n of A112798.

			The sequence of terms together with their prime indices begins:
        4: {1,1}      493: {7,10}      2809: {16,16}
        6: {1,2}      551: {8,10}      3127: {16,17}
       10: {1,3}      667: {9,10}      3481: {17,17}
       15: {2,3}      841: {10,10}     3599: {17,18}
       25: {3,3}      899: {10,11}     3953: {17,19}
       35: {3,4}     1073: {10,12}     4189: {17,20}
       55: {3,5}     1189: {10,13}     4489: {19,19}
       77: {4,5}     1369: {12,12}     4757: {19,20}
      121: {5,5}     1517: {12,13}     5041: {20,20}
      143: {5,6}     1681: {13,13}     5293: {19,22}
      187: {5,7}     1763: {13,14}     5723: {17,25}
      221: {6,7}     1961: {12,16}     5963: {19,24}
      289: {7,7}     2183: {12,17}     6499: {19,25}
      323: {7,8}     2419: {13,17}     6887: {20,25}
      391: {7,9}     2537: {14,17}     7171: {20,26}

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

A024697 is the sum of the same semiprimes.
A332765/A332877 is the squarefree case.
A338904 has this sequence as row maxima.
A339114 is the least among the same semiprimes.
A001358 lists semiprimes, with odd/even terms A046315/A100484.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A037143 lists primes and semiprimes.
A084126 and A084127 give the prime factors of semiprimes.
A087112 groups semiprimes by greater factor.
A320655 counts factorizations into semiprimes.
A338898, A338912, and A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899, A270650, and A270652 give the prime indices of squarefree semiprimes, with difference A338900.
A338907/A338906 list semiprimes of odd/even weight.
A338907/A338908 list squarefree semiprimes of odd/even weight.
Cf. A000040, A001221, A001222, A014342, A025129, A056239, A062198, A098350, A112798, A338905, A339116.

P:= [seq(ithprime(i),i=1..200)]:
[seq(max(seq(P[i]*P[j-i],i=1..j-1)),j=2..200)]; # Robert Israel, Dec 06 2020

Table[Max@@Table[Prime[k]*Prime[n-k],{k,n-1}],{n,2,30}]

A339195 Triangle of squarefree numbers grouped by greatest prime factor, read by rows.

Original entry on oeis.org

1, 2, 3, 6, 5, 10, 15, 30, 7, 14, 21, 35, 42, 70, 105, 210, 11, 22, 33, 55, 66, 77, 110, 154, 165, 231, 330, 385, 462, 770, 1155, 2310, 13, 26, 39, 65, 78, 91, 130, 143, 182, 195, 273, 286, 390, 429, 455, 546, 715, 858, 910, 1001, 1365, 1430, 2002, 2145, 2730, 3003, 4290, 5005, 6006, 10010, 15015, 30030

Offset: 0

Gus Wiseman, Dec 02 2020

Also Heinz numbers of subsets of {1..n} that contain n if n>0, where the Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
A019565 in its triangle form, with each row's terms in increasing order. - Peter Munn, Feb 26 2021
From David James Sycamore, Jan 09 2025: (Start)
Alternative definition, with offset = 1: a(1) = 1. For n>1 if a(n-1) = A002110(k), a(n) = prime(k+1). Otherwise a(n) is the smallest novel squarefree number whose prime factors have already occurred as previous terms.
Permutation of A005117, Squarefree version A379746. (End)

			Triangle begins:
   1
   2
   3   6
   5  10  15  30
   7  14  21  35  42  70  105  210

Alois P. Heinz, Rows n = 0..14, flattened
Michael De Vlieger, Plot p | a(n) at (x,y) = (n,pi(p)), n = 0..2047, 12X vertical exaggeration.
Michael De Vlieger, Fan style binary tree showing a(n), n = 0..2047, with a color function related to the order of a(n) in A019565.
Michael De Vlieger, Fan style binary tree showing a(n), n = 0..2047, with a color function showing 1 in gray, primes in red, primorials in bright green, even squarefree semiprimes in yellow, odd squarefree semiprimes in light green, thereafter, progressively deeper green related to omega(a(n)) = m until m >= 6.

A011782 gives row lengths.
A339360 gives row sums.
A008578 (shifted) is column k = 1.
A100484 is column k = 2.
A001748 is column k = 3.
A002110 is column k = 2^(n-1).
A070826 is column k = 2^(n-1) - 1.
A209862 takes prime indices to binary indices in these terms.
A246867 groups squarefree numbers by Heinz weight, with row sums A147655.
A261144 divides the n-th row by prime(n), with row sums A054640.
A339116 is the restriction to semiprimes, with row sums A339194.
A005117 lists squarefree numbers, ordered lexicographically by prime factors: A019565.
A006881 lists squarefree semiprimes.
A072047 counts prime factors of squarefree numbers.
A319246 is the sum of prime indices of the n-th squarefree number.
A329631 lists prime indices of squarefree numbers, reversed: A319247.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes.
Cf. A001221, A014342, A014466, A019565, A098350, A112798, A320656, A326882, A338901, A379770.
Cf. A379746.

T:= proc(n) option remember; `if`(n=0, 1, (p-> map(
      x-> x*p, {seq(T(i), i=0..n-1)})[])(ithprime(n)))
    end:
seq(T(n), n=0..6);  # Alois P. Heinz, Jan 08 2025

Table[Prime[n]*Sort[Times@@Prime/@#&/@Subsets[Range[n-1]]],{n,5}]

For n > 1, T(n,k) = prime(n) * A261144(n-1,k).

a(n) = A019565(A379770(n)). - Michael De Vlieger, Jan 08 2025

Row n=0 (term 1) prepended by Alois P. Heinz, Jan 08 2025

A359677 Zero-based weighted sum of the reversed (weakly decreasing) prime indices of n.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 0, 3, 2, 1, 0, 3, 0, 1, 2, 6, 0, 4, 0, 3, 2, 1, 0, 6, 3, 1, 6, 3, 0, 4, 0, 10, 2, 1, 3, 7, 0, 1, 2, 6, 0, 4, 0, 3, 6, 1, 0, 10, 4, 5, 2, 3, 0, 9, 3, 6, 2, 1, 0, 7, 0, 1, 6, 15, 3, 4, 0, 3, 2, 5, 0, 11, 0, 1, 7, 3, 4, 4, 0, 10, 12, 1, 0, 7, 3

Offset: 1

Gus Wiseman, Jan 13 2023

nonn

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 zero-based weighted sum of a sequence (y_1,...,y_k) is Sum_{i=1..k} (i-1)*y_i.

			The reversed prime indices of 12 are (2,1,1), so a(12) = 0*2 + 1*1 + 2*1 = 3.

Positions of 0's are A008578.
Positions of 1's are A100484.
The version for standard compositions is A231204, reverse of A124757.
The one-based version is A318283, unreversed A304818.
The one-based version for standard compositions is A359042, rev of A029931.
This is the reverse version of A359674.
First position of n is A359679(n), reverse of A359675.
Positions of first appearances are A359680, reverse of A359676.
A053632 counts compositions by weighted sum.
A112798 lists prime indices, length A001222, sum A056239.
A358136 lists partial sums of prime indices, ranked by A358137, rev A359361.
Cf. A001248, A055932, A243055, A359043, A358194, A359678, A359681, A359683, A359754, A359755.

primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
wts[y_]:=Sum[(i-1)*y[[i]],{i,Length[y]}];
Table[wts[Reverse[primeMS[n]]],{n,100}]

A338908 Squarefree semiprimes whose prime indices sum to an even number.

Original entry on oeis.org

10, 21, 22, 34, 39, 46, 55, 57, 62, 82, 85, 87, 91, 94, 111, 115, 118, 129, 133, 134, 146, 155, 159, 166, 183, 187, 194, 203, 205, 206, 213, 218, 235, 237, 247, 253, 254, 259, 267, 274, 295, 298, 301, 303, 314, 321, 334, 335, 339, 341, 358, 365, 371, 377, 382

Offset: 1

Gus Wiseman, Nov 28 2020

nonn

A squarefree semiprime is a product of any two distinct prime numbers. A prime index of n is a number m such that the m-th prime number divides n. The multiset of prime indices of n is row n of A112798.

			The sequence of terms together with their prime indices begins:
     10: {1,3}     115: {3,9}     213: {2,20}
     21: {2,4}     118: {1,17}    218: {1,29}
     22: {1,5}     129: {2,14}    235: {3,15}
     34: {1,7}     133: {4,8}     237: {2,22}
     39: {2,6}     134: {1,19}    247: {6,8}
     46: {1,9}     146: {1,21}    253: {5,9}
     55: {3,5}     155: {3,11}    254: {1,31}
     57: {2,8}     159: {2,16}    259: {4,12}
     62: {1,11}    166: {1,23}    267: {2,24}
     82: {1,13}    183: {2,18}    274: {1,33}
     85: {3,7}     187: {5,7}     295: {3,17}
     87: {2,10}    194: {1,25}    298: {1,35}
     91: {4,6}     203: {4,10}    301: {4,14}
     94: {1,15}    205: {3,13}    303: {2,26}
    111: {2,12}    206: {1,27}    314: {1,37}

A031215 looks at primes instead of semiprimes.
A300061 and A319241 (squarefree) look all numbers (not just semiprimes).
A338905 has this as union of even-indexed rows.
A338906 is the nonsquarefree version.
A338907 is the odd version.
A001358 lists semiprimes, with odd/even terms A046315/A100484.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A024697 is the sum of semiprimes of weight n.
A025129 is the sum of squarefree semiprimes of weight n.
A056239 gives the sum of prime indices of n.
A289182/A115392 list the positions of odd/even terms in A001358.
A320656 counts factorizations into squarefree semiprimes.
A332765 gives the greatest squarefree semiprime of weight n.
A338898, A338912, and A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899, A270650, and A270652 give the prime indices of squarefree semiprimes, with difference A338900.
A338904 groups semiprimes by weight.
A338911 lists products of pairs of primes both of even index.
A339114/A339115 give the least/greatest semiprime of weight n.
A339116 groups squarefree semiprimes by greater prime factor.
Cf. A000040, A001221, A001222, A087112, A098350, A112798, A168472, A338901, A338904, A339004, A339005.

Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&& EvenQ[Total[PrimePi/@First/@FactorInteger[#]]]&]

A339005 Numbers of the form prime(x) * prime(y) where x properly divides y. Squarefree semiprimes with divisible prime indices.

Original entry on oeis.org

6, 10, 14, 21, 22, 26, 34, 38, 39, 46, 57, 58, 62, 65, 74, 82, 86, 87, 94, 106, 111, 115, 118, 122, 129, 133, 134, 142, 146, 158, 159, 166, 178, 183, 185, 194, 202, 206, 213, 214, 218, 226, 235, 237, 254, 259, 262, 267, 274, 278, 298, 302, 303, 305, 314, 319

Offset: 1

Gus Wiseman, Dec 05 2020

nonn

A squarefree semiprime (A006881) is a product of any two distinct prime numbers. A prime index of n is a number m such that the m-th prime number divides n. The multiset of prime indices of n is row n of A112798.

			The sequence of terms together with their prime indices begins:
    6: {1,2}    82: {1,13}  159: {2,16}  259: {4,12}
   10: {1,3}    86: {1,14}  166: {1,23}  262: {1,32}
   14: {1,4}    87: {2,10}  178: {1,24}  267: {2,24}
   21: {2,4}    94: {1,15}  183: {2,18}  274: {1,33}
   22: {1,5}   106: {1,16}  185: {3,12}  278: {1,34}
   26: {1,6}   111: {2,12}  194: {1,25}  298: {1,35}
   34: {1,7}   115: {3,9}   202: {1,26}  302: {1,36}
   38: {1,8}   118: {1,17}  206: {1,27}  303: {2,26}
   39: {2,6}   122: {1,18}  213: {2,20}  305: {3,18}
   46: {1,9}   129: {2,14}  214: {1,28}  314: {1,37}
   57: {2,8}   133: {4,8}   218: {1,29}  319: {5,10}
   58: {1,10}  134: {1,19}  226: {1,30}  321: {2,28}
   62: {1,11}  142: {1,20}  235: {3,15}  326: {1,38}
   65: {3,6}   146: {1,21}  237: {2,22}  334: {1,39}
   74: {1,12}  158: {1,22}  254: {1,31}  339: {2,30}

A300912 is the version for relative primality.
A318990 is the not necessarily squarefree version.
A339002 is the version for non-relative primality.
A339003 is the version for odd indices.
A339004 is the version for even indices
A001358 lists semiprimes.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes, with odd/even terms A046388/A100484.
A320655 counts factorizations into semiprimes.
A320656 counts factorizations into squarefree semiprimes.
A338898/A338912/A338913 give the prime indices of semiprimes, with product A087794, sum A176504, and difference A176506.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes, with difference A338900.
Cf. A001221, A112798, A166237, A320911, A338901, A338904, A338909.

Select[Range[100],SquareFreeQ[#]&&PrimeOmega[#]==2&& Divisible@@Reverse[PrimePi/@First/@FactorInteger[#]]&]

Equals A318990 \ A000290.

A112774 Semiprimes of the form 6n+4.

Original entry on oeis.org

4, 10, 22, 34, 46, 58, 82, 94, 106, 118, 142, 166, 178, 202, 214, 226, 262, 274, 298, 334, 346, 358, 382, 394, 454, 466, 478, 502, 514, 526, 538, 562, 586, 622, 634, 694, 706, 718, 766, 778, 802, 838, 862, 886, 898, 922, 934, 958, 982, 1006, 1018, 1042, 1114

Offset: 1

Jonathan Vos Post and Ray Chandler, Oct 15 2005

{6} + A112772 + A112774 = A100484 = 2*A000040.

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

IsSemiprime:=func; [s: n in [0..200] | IsSemiprime(s) where s is 6*n + 4]; // Vincenzo Librandi, Sep 22 2012

Select[6 Range[0, 200] + 4, PrimeOmega[#] == 2&] (* Vincenzo Librandi, Sep 22 2012 *)

from sympy import factorint
def semiprime(n): f = factorint(n); return sum(f[p] for p in f) == 2
print(list(filter(semiprime, range(4, 1115, 6)))) # Michael S. Branicky, Apr 10 2021

a(n) = 2 * A003627(n) = 6 * A024893(n) + 4.

A209211 Numbers n such that n-1 and phi(n) are relatively prime.

Original entry on oeis.org

1, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 54, 56, 58, 60, 62, 64, 68, 72, 74, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 114, 116, 118, 120, 122, 126, 128, 132, 134, 136, 138

Offset: 1

José María Grau Ribas, Mar 06 2012

nonn

A063994(a(n)) = 1. - Reinhard Zumkeller, Mar 02 2013
a(n) = A111305(n-2) for n >= 3. - Emmanuel Vantieghem, Jul 03 2013
n such that A049559(n) = 1.  Includes A100484 and A000079. - Robert Israel, Nov 09 2015
All terms except the first one are even. Missing even terms are A039772. - Robert G. Wilson v, Sep 26 2016
Numbers n such that A187730(n) = 1. - Thomas Ordowski, Dec 29 2016

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A000010, A000079, A003277, A039772, A049559, A063994, A100484, A111305.

a209211 n = a209211_list !! (n-1)
a209211_list = filter (\x -> (x - 1) `gcd` a000010 x == 1) [1..]
-- Reinhard Zumkeller, Mar 02 2013

select(n -> igcd(n-1, numtheory:-phi(n)) = 1, [$1..1000]); # Robert Israel, Nov 09 2015

Select[Range[200], GCD[# - 1, EulerPhi[#]] == 1 &]

isok(n) = gcd(n-1, eulerphi(n)) == 1; \\ Michel Marcus, Sep 26 2016

A264828 Nonprimes that are not twice a prime.

Original entry on oeis.org

1, 8, 9, 12, 15, 16, 18, 20, 21, 24, 25, 27, 28, 30, 32, 33, 35, 36, 39, 40, 42, 44, 45, 48, 49, 50, 51, 52, 54, 55, 56, 57, 60, 63, 64, 65, 66, 68, 69, 70, 72, 75, 76, 77, 78, 80, 81, 84, 85, 87, 88, 90, 91, 92, 93, 95, 96, 98, 99, 100, 102, 104

Offset: 1

Giovanni Teofilatto, Nov 26 2015

Except for the initial 1, if n is in the sequence, so is k*n for all k > 1. So the odd semiprimes (A046315) and numbers of the form 4*p (A001749) where p is prime are core subsequences which give the initial terms of arithmetic progressions in this sequence. - Altug Alkan, Nov 29 2015

N. J. A. Sloane, Table of n, a(n) for n = 1..20000 [Terms 1 to 10000 from _Robert Israel_.]

Cf. A009188, A018252, A100484.

Primes, Nonprimes:= selectremove(isprime, {$1..1000}):
sort(convert(Nonprimes minus map(`*`,Primes,2),list)); # Robert Israel, Nov 30 2015

Select[Range@ 104, And[! PrimeQ@ #, Or[PrimeOmega@ # != 2, OddQ@ #]] &] (* Michael De Vlieger, Nov 27 2015 *)
Select[Range@110, Nor[PrimeQ[#], PrimeQ[#/2]] &] (* Vincenzo Librandi, Jan 22 2016 *)

print1(1, ", "); forcomposite(n=1, 1e3, if(n % 2 == 1 || !isprime(n/2), print1(n, ", "))) \\ Altug Alkan, Dec 01 2015

from itertools import count, islice
from sympy import isprime
def A264828_gen(startvalue=1): # generator of terms >= startvalue
    return filter(lambda n:not (isprime(n) or (n&1^1 and isprime(n>>1))),count(max(startvalue,1)))
A264828_list = list(islice(A264828_gen(),20)) # Chai Wah Wu, Mar 26 2024

from sympy import primepi
def A264828(n):
    def f(x): return int(n+primepi(x)+primepi(x>>1))
    m, k = n, f(n)
    while m != k: m, k = k, f(k)
    return m # Chai Wah Wu, Oct 17 2024

a(n) = A009188(n-2) for n>=3. - Alois P. Heinz, Oct 17 2024

A291761 Restricted growth sequence transform of ((-1)^n)*A046523(n); filter combining the parity and the prime signature of n.

Original entry on oeis.org

1, 2, 3, 4, 3, 5, 3, 6, 7, 5, 3, 8, 3, 5, 9, 10, 3, 8, 3, 8, 9, 5, 3, 11, 7, 5, 12, 8, 3, 13, 3, 14, 9, 5, 9, 15, 3, 5, 9, 11, 3, 13, 3, 8, 16, 5, 3, 17, 7, 8, 9, 8, 3, 11, 9, 11, 9, 5, 3, 18, 3, 5, 16, 19, 9, 13, 3, 8, 9, 13, 3, 20, 3, 5, 16, 8, 9, 13, 3, 17, 21, 5, 3, 18, 9, 5, 9, 11, 3, 18, 9, 8, 9, 5, 9, 22, 3, 8, 16, 15, 3, 13, 3, 11, 23, 5, 3, 20, 3, 13

Offset: 1

Antti Karttunen, Sep 11 2017

nonn

Equally, restricted growth sequence transform of sequence b defined as b(1) = 1, and for n > 1, b(n) = A046523(n) + A000035(n), which starts as 1, 2, 3, 4, 3, 6, 3, 8, 5, 6, 3, 12, 3, 6, 7, 16, 3, 12, 3, 12, ...

Antti Karttunen, Table of n, a(n) for n = 1..65537

Cf. A291767, A291768 (bisections), A147516.
Cf. A046523, A101296, A286161, A286251, A286367, A291762 (related or similar filtering sequences).
Cf. A065091 (positions of 3's), A100484 (of 4 and 5's), A001248 (of 4 and 7's), A046388 (of 9's), A030078 (of 6 and 12's).
Cf. A098108 (one of the matching sequences).

rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ This function from Charles R Greathouse IV, Aug 17 2011
write_to_bfile(1,rgs_transform(vector(65537,n,((-1)^n)*A046523(n))),"b291761.txt");
\\ Or alternatively:
f(n) = if(1==n,n,A046523(n)+(n%2));
write_to_bfile(1,rgs_transform(vector(16385,n,f(n))),"b291761.txt");

A338903 Number of integer partitions of the n-th squarefree semiprime into squarefree semiprimes.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 3, 3, 5, 4, 6, 5, 12, 14, 19, 22, 27, 36, 38, 51, 77, 86, 128, 141, 163, 163, 207, 233, 259, 260, 514, 657, 813, 983, 1010, 1215, 1255, 1720, 2112, 2256, 3171, 3370, 3499, 3864, 4103, 6292, 7313, 7620, 8374, 10650, 17579, 18462, 23034, 25180

Offset: 1

Gus Wiseman, Nov 24 2020

nonn

A squarefree semiprime (A006881) is a product of any two distinct prime numbers.

			The a(n) partitions for n = 1, 5, 7, 9, 10, 11, 13:
  6  21    26       34          35        38           46
     15,6  14,6,6   22,6,6      21,14     26,6,6       34,6,6
           10,10,6  14,14,6     15,14,6   22,10,6      26,14,6
                    14,10,10    15,10,10  14,14,10     21,15,10
                    10,6,6,6,6            14,6,6,6,6   22,14,10
                                          10,10,6,6,6  26,10,10
                                                       15,15,10,6
                                                       22,6,6,6,6
                                                       14,14,6,6,6
                                                       14,10,10,6,6
                                                       10,10,10,10,6
                                                       10,6,6,6,6,6,6

A002100 counts partitions into squarefree semiprimes.
A056768 uses primes instead of squarefree semiprimes.
A101048 counts partitions into semiprimes.
A338902 is the not necessarily squarefree version.
A339113 includes the Heinz numbers of these partitions.
A001358 lists semiprimes, with odd and even terms A046315 and A100484.
A006881 lists squarefree semiprimes, with odd and even terms A046388 and A100484.
A320656 counts factorizations into squarefree semiprimes.
A338898/A338912/A338913 give prime indices of semiprimes, with sum/difference/product A176504/A176506/A087794.
A338899, A270650, and A270652 give the prime indices of squarefree semiprimes.
Cf. A000041, A000607, A065516, A115392, A128301, A320655, A320732, A320892, A320912, A338915, A338916.

nn=100;
sqs=Select[Range[nn],SquareFreeQ[#]&&PrimeOmega[#]==2&];
Table[Length[IntegerPartitions[n,All,sqs]],{n,sqs}]

a(n) = A002100(A006881(n)).

cp's OEIS Frontend

A339115 Greatest semiprime whose prime indices sum to n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A339195 Triangle of squarefree numbers grouped by greatest prime factor, read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

Extensions

A359677 Zero-based weighted sum of the reversed (weakly decreasing) prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A338908 Squarefree semiprimes whose prime indices sum to an even number.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A339005 Numbers of the form prime(x) * prime(y) where x properly divides y. Squarefree semiprimes with divisible prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A112774 Semiprimes of the form 6n+4.

Views

Author

Keywords

Comments

Links

Programs

Magma

Mathematica

Python

Formula

A209211 Numbers n such that n-1 and phi(n) are relatively prime.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

A264828 Nonprimes that are not twice a prime.

Views

Author

Keywords