A376657 -id:A376657 - cp's OEIS frontend

A379308 Number of integer partitions of n with a unique squarefree part.

0, 1, 1, 1, 0, 2, 2, 2, 0, 3, 5, 5, 1, 6, 9, 9, 2, 10, 14, 18, 6, 18, 24, 30, 11, 28, 39, 47, 24, 48, 63, 76, 41, 74, 95, 118, 65, 120, 149, 181, 107, 181, 221, 266, 169, 266, 335, 398, 262, 394, 487, 578, 391, 578, 697, 844, 592, 834, 997, 1198, 867

Offset: 0

Gus Wiseman, Dec 26 2024

nonn

			The a(1) = 1 through a(11) = 5 partitions:
  (1)  (2)  (3)  .  (5)    (6)    (7)    .  (5,4)    (10)     (11)
                    (4,1)  (4,2)  (4,3)     (8,1)    (6,4)    (7,4)
                                            (4,4,1)  (8,2)    (8,3)
                                                     (9,1)    (9,2)
                                                     (4,4,2)  (4,4,3)

If all parts are squarefree we have A073576 (strict A087188), ranks A302478.
If no parts are squarefree we have A114374 (strict A256012), ranks A379307.
For composite instead of squarefree we have A379302 (strict A379303), ranks A379301.
For prime instead of squarefree we have A379304, (strict A379305), ranks A331915.
The strict case is A379309.
For old prime instead of squarefree we have A379314, (strict A379315), ranks A379312.
Ranked by A379316, positions of 1 in A379306.
A000041 counts integer partitions, strict A000009.
A005117 lists the squarefree numbers, differences A076259.
A013929 lists the nonsquarefree numbers, differences A078147.
A377038 gives k-th differences of squarefree numbers.
A379310 counts nonsquarefree prime indices.
Cf. A000586, A000607, A002095, A013928, A023895, A034891, A072284, A073247, A120327, A175804, A376657, A377430.

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

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 *)

cp's OEIS Frontend

A379308 Number of integer partitions of n with a unique squarefree part.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica