A114374 -id:A114374 - cp's OEIS frontend

A379311 Number of prime indices of n that are 1 or prime.

0, 1, 1, 2, 1, 2, 0, 3, 2, 2, 1, 3, 0, 1, 2, 4, 1, 3, 0, 3, 1, 2, 0, 4, 2, 1, 3, 2, 0, 3, 1, 5, 2, 2, 1, 4, 0, 1, 1, 4, 1, 2, 0, 3, 3, 1, 0, 5, 0, 3, 2, 2, 0, 4, 2, 3, 1, 1, 1, 4, 0, 2, 2, 6, 1, 3, 1, 3, 1, 2, 0, 5, 0, 1, 3, 2, 1, 2, 0, 5, 4, 2, 1, 3, 2, 1, 1

Offset: 1

Gus Wiseman, Dec 27 2024

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 prime indices of 39 are {2,6}, so a(39) = 1.
The prime indices of 70 are {1,3,4}, so a(70) = 2.
The prime indices of 98 are {1,4,4}, so a(98) = 1.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 1.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 2.

Positions of first appearances are A000079.
These "old" primes are listed by A008578.
Positions of zero are A320629, counted by A023895 (strict A204389).
Positions of one are A379312, counted by A379314 (strict A379315).
Positions of nonzero terms are A379313.
A000040 lists the prime numbers, differences A001223.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A080339 is the characteristic function for the old prime numbers.
A376682 gives k-th differences of old prime numbers, see A030016, A075526, A173390, A376683, A376855.
Other counts of prime indices:
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A000586, A000607, A076610, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.
Cf. A034891, A036234, A036497, A038550, A087436, A302540, A379300, A379301.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[prix[n],#==1||PrimeQ[#]&]],{n,100}]

Totally additive with a(prime(k)) = A080339(k).

A379302 Number of integer partitions of n with a unique composite part.

Original entry on oeis.org

0, 0, 0, 0, 1, 1, 3, 4, 7, 11, 16, 23, 32, 43, 58, 77, 100, 129, 164, 207, 259, 323, 398, 489, 595, 723, 872, 1049, 1255, 1495, 1774, 2097, 2472, 2903, 3399, 3969, 4618, 5362, 6210, 7173, 8268, 9506, 10907, 12488, 14271, 16278, 18532, 21061, 23893, 27064

Offset: 0

Gus Wiseman, Dec 25 2024

nonn

			The a(0) = 0 through a(9) = 11 partitions:
  .  .  .  .  (4)  (41)  (6)    (43)    (8)      (9)
                         (42)   (61)    (62)     (54)
                         (411)  (421)   (422)    (63)
                                (4111)  (431)    (81)
                                        (611)    (432)
                                        (4211)   (621)
                                        (41111)  (4221)
                                                 (4311)
                                                 (6111)
                                                 (42111)
                                                 (411111)

If all parts are composite we have A023895 (strict A204389), ranks A320629.
If no parts are composite we have A034891 (strict A036497), ranks A302540.
Ranked by A379301 = positions of 1 in A379300.
The strict case is A379303.
For a unique prime part we have A379304 (strict A379305), ranks A331915.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers.
Cf. A000070, A000586, A000607, A002095, A038348, A096258, A114374, A330944, A379308, A379309, A379314, A379315.

Table[Length[Select[IntegerPartitions[n],Count[#,_?CompositeQ]==1&]],{n,0,30}]

A379307 Positive integers whose prime indices include no squarefree numbers.

Original entry on oeis.org

1, 7, 19, 23, 37, 49, 53, 61, 71, 89, 97, 103, 107, 131, 133, 151, 161, 173, 193, 197, 223, 227, 229, 239, 251, 259, 263, 281, 307, 311, 337, 343, 359, 361, 371, 379, 383, 409, 419, 427, 433, 437, 457, 463, 479, 497, 503, 521, 523, 529, 541, 569, 593, 613, 623

Offset: 1

Gus Wiseman, Dec 27 2024

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 terms together with their prime indices begin:
    1: {}
    7: {4}
   19: {8}
   23: {9}
   37: {12}
   49: {4,4}
   53: {16}
   61: {18}
   71: {20}
   89: {24}
   97: {25}
  103: {27}
  107: {28}
  131: {32}
  133: {4,8}
  151: {36}
  161: {4,9}
  173: {40}

Partitions of this type are counted by A114374, strict A256012.
Positions of zero in A379306.
For a unique squarefree part we have A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A038550, A057627, A068361, A070321, A071403, A072284, A087436, A112929, A377430, A378086.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000],Length[Select[prix[#],SquareFreeQ]]==0&]

A379310 Number of nonsquarefree prime indices of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0

Offset: 1

Gus Wiseman, Dec 27 2024

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 prime indices of 39 are {2,6}, so a(39) = 0.
The prime indices of 70 are {1,3,4}, so a(70) = 1.
The prime indices of 98 are {1,4,4}, so a(98) = 2.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 2.

Positions of first appearances are A000420.
Positions of zero are A302478, counted by A073576 (strict A087188).
No squarefree parts: A379307, counted by A114374 (strict A256012).
One squarefree part: A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A038550, A057627, A068361, A070321, A071403, A087436, A112929, A120327, A378086.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[prix[n],Not@*SquareFreeQ]],{n,100}]

Totally additive with a(prime(k)) = A107078(k) = 1 - A008966(k).

A376594 Inflection and undulation points in the sequence of nonsquarefree numbers (A013929).

Original entry on oeis.org

5, 11, 12, 13, 17, 19, 20, 25, 33, 37, 39, 40, 41, 47, 53, 57, 62, 70, 71, 76, 81, 82, 83, 88, 92, 93, 96, 98, 103, 109, 113, 118, 123, 130, 131, 133, 137, 139, 146, 149, 154, 155, 156, 161, 165, 168, 169, 174, 179, 180, 183, 187, 188, 189, 193, 201, 211, 213

Offset: 1

Gus Wiseman, Oct 04 2024

nonn

These are points at which the second differences (A376593) are zero.

			The nonsquarefree numbers (A013929) are:
  4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 50, 52, 54, ...
with first differences (A078147):
  4, 1, 3, 4, 2, 2, 4, 1, 2, 1, 4, 4, 4, 4, 1, 3, 1, 1, 2, 2, 2, 4, 3, 1, 4, 4, 3, ...
with first differences (A376593):
  -3, 2, 1, -2, 0, 2, -3, 1, -1, 3, 0, 0, 0, -3, 2, -2, 0, 1, 0, 0, 2, -1, -2, 3, ...
with zeros (A376594) at:
  5, 11, 12, 13, 17, 19, 20, 25, 33, 37, 39, 40, 41, 47, 53, 57, 62, 70, 71, 76, ...

Gus Wiseman, Inflection and undulation points in the nonsquarefree numbers.

The first differences were A078147.
These are the zeros of A376593.
The complement is A376595.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A064113 lists positions of adjacent equal prime gaps.
A114374 counts partitions into nonsquarefree numbers.
For inflections and undulations: A064113 (prime), A376602 (composite), A376588 (non-perfect-power), A376597 (prime-power), A376600 (non-prime-power).
For nonsquarefree numbers: A013929 (terms), A078147 (first differences), A376593 (second differences), A376595 (nonzero curvature).
Cf. A007674, A053797, A053806, A061398, A112926, A120992, A251092, A375707, A376312, A376590, A376593.

Join@@Position[Differences[Select[Range[100],!SquareFreeQ[#]&],2],0]

A376595 Points of nonzero curvature in the sequence of nonsquarefree numbers (A013929).

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 10, 14, 15, 16, 18, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 34, 35, 36, 38, 42, 43, 44, 45, 46, 48, 49, 50, 51, 52, 54, 55, 56, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 72, 73, 74, 75, 77, 78, 79, 80, 84, 85, 86, 87, 89, 90, 91

Offset: 1

Gus Wiseman, Oct 04 2024

nonn

These are points at which the second differences (A376593) are nonzero.

			The nonsquarefree numbers (A013929) are:
  4, 8, 9, 12, 16, 18, 20, 24, 25, 27, 28, 32, 36, 40, 44, 45, 48, 49, 50, 52, 54, ...
with first differences (A078147):
  4, 1, 3, 4, 2, 2, 4, 1, 2, 1, 4, 4, 4, 4, 1, 3, 1, 1, 2, 2, 2, 4, 3, 1, 4, 4, 3, ...
with first differences (A376593):
  -3, 2, 1, -2, 0, 2, -3, 1, -1, 3, 0, 0, 0, -3, 2, -2, 0, 1, 0, 0, 2, -1, -2, 3, ...
with nonzeros (A376594) at:
  1, 2, 3, 4, 6, 7, 8, 9, 10, 14, 15, 16, 18, 21, 22, 23, 24, 26, 27, 28, 29, 30, ...

Gus Wiseman, Points of nonzero curvature in the nonsquarefree numbers.

The first differences were A078147.
These are the nonzeros of A376593.
The complement is A376594.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, differences A076259.
A013929 lists nonsquarefree numbers, differences A078147.
A114374 counts integer partitions into nonsquarefree numbers.
For points of nonzero curvature: A333214 (prime), A376603 (composite), A376589 (non-perfect-power), A376592 (squarefree), A376598 (prime-power), A376601 (non-prime-power).
For nonsquarefree numbers: A078147 (first differences), A376593 (second differences), A376594 (inflections and undulations).
Cf. A007674, A036263, A053797, A053806, A061398, A120992, A373198, A375707, A376306, A376312, A376590.

Join@@Position[Sign[Differences[Select[Range[100],!SquareFreeQ[#]&],2]],1|-1]

A379306 Number of squarefree prime indices of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 0, 3, 2, 2, 1, 3, 1, 1, 2, 4, 1, 3, 0, 3, 1, 2, 0, 4, 2, 2, 3, 2, 1, 3, 1, 5, 2, 2, 1, 4, 0, 1, 2, 4, 1, 2, 1, 3, 3, 1, 1, 5, 0, 3, 2, 3, 0, 4, 2, 3, 1, 2, 1, 4, 0, 2, 2, 6, 2, 3, 1, 3, 1, 2, 0, 5, 1, 1, 3, 2, 1, 3, 1, 5, 4, 2, 1, 3, 2, 2, 2

Offset: 1

Gus Wiseman, Dec 25 2024

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 prime indices of 39 are {2,6}, so a(39) = 2.
The prime indices of 70 are {1,3,4}, so a(70) = 2.
The prime indices of 98 are {1,4,4}, so a(98) = 1.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 3.

Positions of first appearances are A000079.
Positions of zero are A379307, counted by A114374 (strict A256012).
Positions of one are A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A057627, A068361, A070321, A071403, A072284, A112925, A112929, A120327, A377430, A378086.

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

Totally additive with a(prime(k)) = A008966(k).

A376679 Number of strict integer factorizations of n into nonsquarefree factors > 1.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 1, 0, 0, 0

Offset: 1

Gus Wiseman, Oct 08 2024

nonn

			The a(3456) = 28 factorizations are:
  (4*8*9*12)  (4*9*96)    (36*96)   (3456)
              (8*9*48)    (4*864)
              (4*12*72)   (48*72)
              (4*16*54)   (54*64)
              (4*18*48)   (8*432)
              (4*24*36)   (9*384)
              (4*27*32)   (12*288)
              (4*8*108)   (16*216)
              (8*12*36)   (18*192)
              (8*16*27)   (24*144)
              (8*18*24)   (27*128)
              (9*12*32)   (32*108)
              (9*16*24)
              (12*16*18)

Dominic McCarty, Table of n, a(n) for n = 1..10000

Positions of zeros are A005117 (squarefree numbers), complement A013929.
For squarefree instead of nonsquarefree we have A050326, non-strict A050320.
For prime-powers we have A050361, non-strict A000688.
For nonprime numbers we have A050372, non-strict A050370.
The version for partitions is A256012, non-strict A114374.
For perfect-powers we have A323090, non-strict A294068.
The non-strict version is A376657.
Nonsquarefree numbers:
- A078147 (first differences)
- A376593 (second differences)
- A376594 (inflections and undulations)
- A376595 (nonzero curvature)
A000040 lists the prime numbers, differences A001223.
A001055 counts integer factorizations, strict A045778.
A005117 lists squarefree numbers, differences A076259.
A317829 counts factorizations of superprimorials, strict A337069.
Cf. A008480, A053797, A053806, A061398, A089259, A120992, A303707, A322452, A375707, A376312.

function nextNonSquareFree(val){val+=1;for(let i=2;i*i<=val;i+=1){if(val%i==0&&val%(i*i)==0){return val}}return nextNonSquareFree(val)}function strictFactorCount(val,maxFactor){if(val==1){return 1}let sum=0;while(maxFactorDominic McCarty, Oct 19 2024

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],UnsameQ@@#&&NoneTrue[#,SquareFreeQ]&]],{n,100}] (* corrected by Gus Wiseman, Jun 27 2025 *)

A117395 Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 3, 4, 8, 14, 20, 27, 40, 59, 80, 106, 145, 198, 262, 340, 447, 584, 751, 956, 1221, 1555, 1959, 2454, 3073, 3839, 4760, 5875, 7245, 8912, 10909, 13303, 16206, 19696, 23848, 28788, 34704, 41755, 50085

Offset: 1

Reinhard Zumkeller, Mar 11 2006

nonn

a(n) = A000041(n) - A073576(n) - A114374(n).

			a(8) = #{2^2+3+1,2^2+2+2,2^2+2+1+1,2^2+1+1+1+1} = 4.

Cf. A005117, A013929.

A376657 Number of integer factorizations of n into nonsquarefree factors > 1.

Original entry on oeis.org

1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 2, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 2, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 4, 0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 1, 0, 0, 0

Offset: 1

Gus Wiseman, Oct 07 2024

nonn

			The a(n) factorizations for n = 16, 64, 72, 144, 192, 256, 288:
  (16)   (64)     (72)    (144)    (192)     (256)      (288)
  (4*4)  (8*8)    (8*9)   (4*36)   (4*48)    (4*64)     (4*72)
         (4*16)   (4*18)  (8*18)   (8*24)    (8*32)     (8*36)
         (4*4*4)          (9*16)   (12*16)   (16*16)    (9*32)
                          (12*12)  (4*4*12)  (4*8*8)    (12*24)
                          (4*4*9)            (4*4*16)   (16*18)
                                             (4*4*4*4)  (4*8*9)
                                                        (4*4*18)

For prime-powers we have A000688.
Positions of zeros are A005117 (squarefree numbers), complement A013929.
For squarefree instead of nonsquarefree we have A050320, strict A050326.
For nonprime numbers we have A050370.
The version for partitions is A114374.
For perfect-powers we have A294068.
For non-perfect-powers we have A303707.
For non-prime-powers we have A322452.
The strict case is A376679.
Nonsquarefree numbers:
- A078147 (first differences)
- A376593 (second differences)
- A376594 (inflections and undulations)
- A376595 (nonzero curvature)
A000040 lists the prime numbers, differences A001223.
A001055 counts integer factorizations, strict A045778.
A005117 lists squarefree numbers, differences A076259.
A317829 counts factorizations of superprimorials, strict A337069.
Cf. A008480, A053797, A053806, A061398, A089259, A120992, A124010, A182853, A373198, A375707, A376312.

facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
Table[Length[Select[facs[n],NoneTrue[SquareFreeQ]]],{n,100}]

cp's OEIS Frontend

A379311 Number of prime indices of n that are 1 or prime.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A379302 Number of integer partitions of n with a unique composite part.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A379307 Positive integers whose prime indices include no squarefree numbers.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A379310 Number of nonsquarefree prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A376594 Inflection and undulation points in the sequence of nonsquarefree numbers (A013929).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A376595 Points of nonzero curvature in the sequence of nonsquarefree numbers (A013929).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A379306 Number of squarefree prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A376679 Number of strict integer factorizations of n into nonsquarefree factors > 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

JavaScript

Mathematica

A117395 Number of partitions of n into parts that are neither all squarefree, nor all not squarefree.

Views