A347044 -id:A347044 - cp's OEIS frontend

A360677 Sum of the right half (exclusive) of the prime indices of n.

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

Offset: 1

Gus Wiseman, Mar 05 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 prime indices of 810 are {1,2,2,2,2,3}, with right half (exclusive) {2,2,3}, so a(810) = 7.
The prime indices of 3675 are {2,3,3,4,4}, with right half (exclusive) {4,4}, so a(3675) = 8.

Positions of 0's are 1 and A000040.
Positions of last appearances are A004171.
Positions of first appearances are A100484.
These partitions are counted by A360672.
The value k > 0 appears A360673(k) times, inclusive A360671.
The left version is A360676.
The inclusive version is A360679.
A112798 lists prime indices, length A001222, sum A056239, median* A360005.
A360616 gives half of bigomega (exclusive), inclusive A360617.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A001248, A026424, A359908, A359912, A360006, A360457.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Total[Take[prix[n],-Floor[Length[prix[n]]/2]]],{n,100}]

Last position of k is 2^(2k+1).
A360676(n) + A360679(n) = A001222(n).
A360677(n) + A360678(n) = A001222(n).

A360678 Sum of the left half (inclusive) of the prime indices of n.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Mar 05 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 prime indices of 810 are {1,2,2,2,2,3}, with left half (inclusive) {1,2,2}, so a(810) = 5.
The prime indices of 3675 are {2,3,3,4,4}, with left half (inclusive) {2,3,3}, so a(3675) = 8.

Positions of first appearances are 1 and A001248.
Positions of 1's are A001747.
These partitions are counted by A360675 with rows reversed.
The exclusive version is A360676.
The right version is A360679.
A112798 lists prime indices, length A001222, sum A056239, median* A360005.
A360616 gives half of bigomega (exclusive), inclusive A360617.
A360673 counts multisets by right sum (exclusive), inclusive A360671.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A026424, A280076, A359912, A360006, A360457.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Total[Take[prix[n],Ceiling[Length[prix[n]]/2]]],{n,100}]

A360676(n) + A360679(n) = A001222(n).

A360677(n) + A360678(n) = A001222(n).

A360616 Half the number of prime factors of n (counted with multiplicity, A001222), rounded down.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Mar 08 2023

nonn

			The prime indices of 378 are {1,2,2,2,4}, so a(378) = floor(5/2) = 2.

Positions of 0's are 1 and A000040.
Positions of first appearances are A000302 = 2^(2k) for k >= 0.
Positions of 1's are A168645.
Rounding up instead of down gives A360617.
A112798 lists prime indices, length A001222, sum A056239, median* A360005.
A360673 counts multisets by right sum (exclusive), inclusive A360671.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A001248, A026424, A280076, A359912, A360006, A360457, A360674.

Mathematica
```
Table[Floor[PrimeOmega[n]/2],{n,100}]
```

A360617 Half the number of prime factors of n (counted with multiplicity, A001222), rounded up.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Mar 08 2023

nonn

			The prime indices of 378 are {1,2,2,2,4}, so a(378) = ceiling(5/2) = 3.

Positions of 0's and 1's are 1 and A037143.
Positions of first appearances are A081294.
Rounding down instead of up gives A360616.
A112798 lists prime indices, length A001222, sum A056239, median* A360005.
A360673 counts multisets by right sum (exclusive), inclusive A360671.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A000040, A000302, A001248, A026424, A168645, A359912, A360006, A360457.

Mathematica
```
Table[Ceiling[PrimeOmega[n]/2],{n,100}]
```

A347045 Smallest divisor of n with exactly half as many prime factors (counting multiplicity) as n, or 1 if there are none.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 1, 3, 2, 1, 1, 1, 2, 3, 4, 1, 1, 1, 1, 3, 2, 1, 4, 5, 2, 1, 1, 1, 1, 1, 1, 3, 2, 5, 4, 1, 2, 3, 4, 1, 1, 1, 1, 1, 2, 1, 1, 7, 1, 3, 1, 1, 6, 5, 4, 3, 2, 1, 4, 1, 2, 1, 8, 5, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 1, 7, 1, 1, 1, 9, 2, 1, 4, 5, 2, 3

Offset: 1

Gus Wiseman, Aug 16 2021

nonn

			The divisors of 90 with half bigomega are: 6, 9, 10, 15, so a(90) = 6.

Amiram Eldar, Table of n, a(n) for n = 1..10000

The smallest divisor without the condition is A020639 (greatest: A006530).
Positions of 1's are A026424.
Positions of even terms are A063745 = 2*A026424.
The case of powers of 2 is A072345.
Positions of 2's are A100484.
Divisors of this type are counted by A345957 (rounded: A096825).
The rounded version is A347043.
The greatest divisor of this type is A347046 (rounded: A347044).
A000005 counts divisors.
A001221 counts distinct prime factors.
A001222 counts all prime factors (also called bigomega).
A056239 adds up prime indices, row sums of A112798.
A207375 lists central divisors (min: A033676, max: A033677).
A340387 lists numbers whose sum of prime indices is twice bigomega.
A340609 lists numbers whose maximum prime index divides bigomega.
A340610 lists numbers whose maximum prime index is divisible by bigomega.
A347042 counts divisors d|n such that bigomega(d) divides bigomega(n).
Cf. A000720, A001747, A027746, A038548, A056924, A063962, A106529, A140271, A244991, A324522, A335433, A335448.

Table[If[#=={},1,Min[#]]&@Select[Divisors[n], PrimeOmega[#]==PrimeOmega[n]/2&],{n,100}]
a[n_] := Module[{p = Flatten[Table[#[[1]], {#[[2]]}] & /@ FactorInteger[n]], np}, np = Length[p]; If[OddQ[np], 1, Times @@ p[[1 ;; np/2]]]]; Array[a, 100] (* Amiram Eldar, Nov 02 2024 *)

from sympy import divisors, factorint
def a(n):
    npf = len(factorint(n, multiple=True))
    for d in divisors(n)[1:-1]:
        if 2*len(factorint(d, multiple=True)) == npf: return d
    return 1
print([a(n) for n in range(1, 88)]) # Michael S. Branicky, Aug 18 2021

from math import prod
from sympy import factorint
def A347045(n):
    fs = factorint(n,multiple=True)
    q, r = divmod(len(fs),2)
    return 1 if r else prod(fs[:q]) # Chai Wah Wu, Aug 20 2021

a(n) = Product_{k=1..A001222(n)/2} A027746(n,k) if A001222(n) is even, and 1 otherwise. - Amiram Eldar, Nov 02 2024

A347046 Greatest divisor of n with exactly half as many prime factors (counting multiplicity) as n, or 1 if there are none.

Original entry on oeis.org

1, 1, 1, 2, 1, 3, 1, 1, 3, 5, 1, 1, 1, 7, 5, 4, 1, 1, 1, 1, 7, 11, 1, 6, 5, 13, 1, 1, 1, 1, 1, 1, 11, 17, 7, 9, 1, 19, 13, 10, 1, 1, 1, 1, 1, 23, 1, 1, 7, 1, 17, 1, 1, 9, 11, 14, 19, 29, 1, 15, 1, 31, 1, 8, 13, 1, 1, 1, 23, 1, 1, 1, 1, 37, 1, 1, 11, 1, 1, 1, 9

Offset: 1

Gus Wiseman, Aug 16 2021

nonn

Problem: What are the positions of last appearances > 1?

			The divisors of 90 with half bigomega are: 6, 9, 10, 15, so a(90) = 15.

Amiram Eldar, Table of n, a(n) for n = 1..10000

The greatest divisor without the condition is A006530 (smallest: A020639).
Positions of 1's are A026424.
The case of powers of 2 is A072345.
Positions of first appearances are A123667 (sorted: A123666).
Divisors of this type are counted by A345957 (rounded: A096825).
The rounded version is A347044.
The smallest divisor of this is A347045 (rounded: A347043).
A000005 counts divisors.
A001221 counts distinct prime factors.
A001222 counts all prime factors (also called bigomega).
A056239 adds up prime indices, row sums of A112798.
A207375 lists central divisors (min: A033676, max: A033677).
A340387 lists numbers whose sum of prime indices is twice bigomega.
A340609 lists numbers whose maximum prime index divides bigomega.
A340610 lists numbers whose maximum prime index is divisible by bigomega.
A347042 counts divisors d|n such that bigomega(d) divides bigomega(n).
Cf. A000720, A027746, A038548, A060775, A106529, A244991, A335433, A335448.

Table[If[#=={},1,Max[#]]&@Select[Divisors[n], PrimeOmega[#]==PrimeOmega[n]/2&],{n,100}]
a[n_] := Module[{p = Flatten[Table[#[[1]], {#[[2]]}] & /@ FactorInteger[n]], np}, np = Length[p]; If[OddQ[np], 1, Times @@ p[[np/2+1 ;; np]]]]; Array[a, 100] (* Amiram Eldar, Nov 02 2024 *)

from sympy import divisors, factorint
def a(n):
    npf = len(factorint(n, multiple=True))
    for d in divisors(n)[-1:0:-1]:
        if 2*len(factorint(d, multiple=True)) == npf: return d
    return 1
print([a(n) for n in range(1, 82)]) # Michael S. Branicky, Aug 18 2021

from math import prod
from sympy import factorint
def A347046(n):
    fs = factorint(n,multiple=True)
    q, r = divmod(len(fs),2)
    return 1 if r else prod(fs[q:]) # Chai Wah Wu, Aug 20 2021

a(n) = Product_{k=A001222(n)/2+1..A001222(n)} A027746(n,k) if A001222(n) is even, and 1 otherwise. - Amiram Eldar, Nov 02 2024

A360674 Number of integer partitions of 2n whose left half (exclusive) and right half (inclusive) both sum to n.

Original entry on oeis.org

1, 1, 3, 4, 7, 6, 12, 9, 16, 15, 21, 16, 34, 22, 33, 36, 47, 36, 62, 44, 75, 68, 78, 68, 120, 93, 113, 117, 151, 122, 195, 148, 209, 197, 220, 226, 315, 249, 304, 309, 402, 332, 463, 387, 496, 515, 539, 514, 712, 609, 738, 723, 845, 774, 983, 914, 1111

Offset: 0

Gus Wiseman, Mar 04 2023

nonn

Of course, only one of the two conditions is necessary.

			The a(1) = 1 through a(6) = 12 partitions:
  (11)  (22)    (33)      (44)        (55)          (66)
        (211)   (321)     (422)       (532)         (633)
        (1111)  (21111)   (431)       (541)         (642)
                (111111)  (2222)      (32221)       (651)
                          (22211)     (211111111)   (3333)
                          (2111111)   (1111111111)  (33222)
                          (11111111)                (33321)
                                                    (42222)
                                                    (222222)
                                                    (2222211)
                                                    (21111111111)
                                                    (111111111111)
For example, the partition y = (3,2,2,2,1) has halves (3,2) and (2,2,1), both with sum 5, so y is counted under a(5).

The even-length case is A000005.
Central diagonal of A360672.
These partitions have ranks A360953.
A008284 counts partitions by length, row sums A000041.
A359893 and A359901 count partitions by median.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A237363, A360254, A360671, A360673, A360682.

Table[Length[Select[IntegerPartitions[2n], Total[Take[#,Floor[Length[#]/2]]]==n&]],{n,0,15}]

def accel_asc(n):
    a = [0 for i in range(n + 1)]
    k = 1
    y = n - 1
    while k != 0:
        x = a[k - 1] + 1
        k -= 1
        while 2 * x <= y:
            a[k] = x
            y -= x
            k += 1
        l = k + 1
        while x <= y:
            a[k] = x
            a[l] = y
            yield a[:k + 2]
            x += 1
            y -= 1
        a[k] = x + y
        y = x + y - 1
        yield a[:k + 1]
for y in range(1000):
    num = 0
    for x in accel_asc(2*y):
        stop = len(x)//2+1
        if len(x) % 2 == 0:
            stop -= 1
        right = x[0:stop]
        left = x[stop:]
        if sum(right) == sum(left):
            num += 1
    print(y,num)
# David Consiglio, Jr., Mar 09 2023

a(n) = A360672(2n,n).

More terms from David Consiglio, Jr., Mar 09 2023

A360953 Numbers whose right half of prime indices (exclusive) adds up to half the total sum of prime indices.

Original entry on oeis.org

1, 4, 9, 12, 16, 25, 30, 48, 49, 63, 64, 70, 81, 108, 121, 154, 165, 169, 192, 256, 270, 273, 286, 289, 325, 361, 442, 529, 561, 567, 595, 625, 646, 675, 729, 741, 750, 768, 841, 874, 931, 961, 972, 1024, 1045, 1173, 1334, 1369, 1495, 1575, 1653, 1681, 1750

Offset: 1

Gus Wiseman, Mar 09 2023

nonn

Also numbers whose left half of prime indices (inclusive) adds up to half the total sum of prime indices.

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: {}
     4: {1,1}
     9: {2,2}
    12: {1,1,2}
    16: {1,1,1,1}
    25: {3,3}
    30: {1,2,3}
    48: {1,1,1,1,2}
    49: {4,4}
    63: {2,2,4}
    64: {1,1,1,1,1,1}
    70: {1,3,4}
    81: {2,2,2,2}
   108: {1,1,2,2,2}
For example, the prime indices of 1575 are {2,2,3,3,4}, with right half (exclusive) {3,4}, with sum 7, and the total sum of prime indices is 14, so 1575 is in the sequence.

The left version is A056798.
The inclusive version is A056798.
These partitions are counted by A360674.
The left inclusive version is A360953 (this sequence).
A112798 lists prime indices, length A001222, sum A056239, median* A360005.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A000005, A000040, A001248, A026424, A359912, A360006, A360616, A360617, A360671, A360673.

Select[Range[100],With[{w=Flatten[Cases[FactorInteger[#],{p_,k_}:>Table[PrimePi[p],{k}]]]},Total[Take[w,-Floor[Length[w]/2]]]==Total[w]/2]&]

A360954 Number of finite sets of positive integers whose right half (exclusive) sums to n.

Original entry on oeis.org

1, 0, 1, 3, 6, 10, 15, 22, 29, 41, 50, 70, 81, 113, 126, 176, 191, 264, 286, 389, 413, 569, 595, 798, 861, 1121, 1187, 1585, 1653, 2132, 2334, 2906, 3111, 4006, 4234, 5252, 5818, 6995, 7620, 9453, 10102, 12165, 13663, 15940, 17498, 21127, 22961, 26881, 30222, 34678, 38569

Offset: 0

Gus Wiseman, Mar 09 2023

nonn

			The a(2) = 1 through a(7) = 22 sets:
  {1,2}  {1,3}    {1,4}    {1,5}    {1,6}    {1,7}
         {2,3}    {2,4}    {2,5}    {2,6}    {2,7}
         {1,2,3}  {3,4}    {3,5}    {3,6}    {3,7}
                  {1,2,4}  {4,5}    {4,6}    {4,7}
                  {1,3,4}  {1,2,5}  {5,6}    {5,7}
                  {2,3,4}  {1,3,5}  {1,2,6}  {6,7}
                           {1,4,5}  {1,3,6}  {1,2,7}
                           {2,3,5}  {1,4,6}  {1,3,7}
                           {2,4,5}  {1,5,6}  {1,4,7}
                           {3,4,5}  {2,3,6}  {1,5,7}
                                    {2,4,6}  {1,6,7}
                                    {2,5,6}  {2,3,7}
                                    {3,4,6}  {2,4,7}
                                    {3,5,6}  {2,5,7}
                                    {4,5,6}  {2,6,7}
                                             {3,4,7}
                                             {3,5,7}
                                             {3,6,7}
                                             {4,5,7}
                                             {4,6,7}
                                             {5,6,7}
                                             {1,2,3,4}
For example, the set y = {1,2,3,4} has right half (exclusive) {3,4}, with sum 7, so y is counted under a(7).

Andrew Howroyd, Table of n, a(n) for n = 0..1000

The version for multisets is A360673, inclusive A360671.
The inclusive version is A360955.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A000009, A072233, A359893, A359901, A360956.

Table[Length[Select[Join@@IntegerPartitions/@Range[0,3*k],UnsameQ@@#&&Total[Take[#,Floor[Length[#]/2]]]==k&]],{k,0,15}]

\\ P(n,k) is A072233(n,k).
P(n,k)=polcoef(1/prod(k=1, k, 1 - x^k + O(x*x^n)), n)
a(n)=if(n==0, 1, sum(w=1, sqrt(n), my(t=binomial(w,2)); sum(h=w+1, (n-t)\w, binomial(h, w+1) * P(n-w*h-t, w-1)))) \\ Andrew Howroyd, Mar 13 2023

a(n) = Sum_{w>=1} Sum_{h=w+1..floor((n-binomial(w,2))/w)} binomial(h,w+1) * A072233(n - w*h - binomial(w,2), w-1) for n > 0. - Andrew Howroyd, Mar 13 2023

Terms a(16) and beyond from Andrew Howroyd, Mar 13 2023

A360955 Number of finite sets of positive integers whose right half (inclusive) sums to n.

Original entry on oeis.org

1, 1, 2, 3, 4, 6, 7, 11, 12, 19, 20, 31, 33, 49, 51, 77, 79, 112, 124, 165, 177, 247, 260, 340, 388, 480, 533, 693, 747, 925, 1078, 1271, 1429, 1772, 1966, 2331, 2705, 3123, 3573, 4245, 4737, 5504, 6424, 7254, 8256, 9634, 10889, 12372, 14251, 16031, 18379

Offset: 0

Gus Wiseman, Mar 09 2023

nonn

			The a(1) = 1 through a(8) = 12 sets:
  {1}  {2}    {3}    {4}    {5}      {6}      {7}        {8}
       {1,2}  {1,3}  {1,4}  {1,5}    {1,6}    {1,7}      {1,8}
              {2,3}  {2,4}  {2,5}    {2,6}    {2,7}      {2,8}
                     {3,4}  {3,5}    {3,6}    {3,7}      {3,8}
                            {4,5}    {4,6}    {4,7}      {4,8}
                            {1,2,3}  {5,6}    {5,7}      {5,8}
                                     {1,2,4}  {6,7}      {6,8}
                                              {1,2,5}    {7,8}
                                              {1,3,4}    {1,2,6}
                                              {2,3,4}    {1,3,5}
                                              {1,2,3,4}  {2,3,5}
                                                         {1,2,3,5}
For example, the set y = {2,3,5} has right half (inclusive) {3,5}, with sum 8, so y is counted under a(8).

Andrew Howroyd, Table of n, a(n) for n = 0..1000

The version for multisets is A360671, exclusive A360673.
The exclusive version is A360954.
First for prime indices, second for partitions, third for prime factors:
- A360676 gives left sum (exclusive), counted by A360672, product A361200.
- A360677 gives right sum (exclusive), counted by A360675, product A361201.
- A360678 gives left sum (inclusive), counted by A360675, product A347043.
- A360679 gives right sum (inclusive), counted by A360672, product A347044.
Cf. A000009, A072233, A359893, A359901, A360674, A360956.

Table[Length[Select[Join@@IntegerPartitions/@Range[0,3*k], UnsameQ@@#&&Total[Take[#,Ceiling[Length[#]/2]]]==k&]],{k,0,15}]

\\ P(n,k) is A072233(n,k).
P(n,k)=polcoef(1/prod(k=1, k, 1 - x^k + O(x*x^n)), n)
a(n)=if(n==0, 1, sum(w=1, sqrt(n), my(t=binomial(w,2)); sum(h=w, (n-t)\w, binomial(h, w) * P(n-w*h-t, w-1)))) \\ Andrew Howroyd, Mar 13 2023

a(n) = Sum_{w>=1} Sum_{h=w..floor((n-binomial(w,2))/w)} binomial(h,w) * A072233(n - w*h - binomial(w,2), w-1) for n > 0. - Andrew Howroyd, Mar 13 2023

Terms a(16) and beyond from Andrew Howroyd, Mar 13 2023

cp's OEIS Frontend

A360677 Sum of the right half (exclusive) of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A360678 Sum of the left half (inclusive) of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A360616 Half the number of prime factors of n (counted with multiplicity, A001222), rounded down.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A360617 Half the number of prime factors of n (counted with multiplicity, A001222), rounded up.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A347045 Smallest divisor of n with exactly half as many prime factors (counting multiplicity) as n, or 1 if there are none.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Python

Python

Formula

A347046 Greatest divisor of n with exactly half as many prime factors (counting multiplicity) as n, or 1 if there are none.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Python

Formula

A360674 Number of integer partitions of 2n whose left half (exclusive) and right half (inclusive) both sum to n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Python

Formula

Extensions

A360953 Numbers whose right half of prime indices (exclusive) adds up to half the total sum of prime indices.

Views

Author

Keywords

Comments

Examples