A360005 -id:A360005 - cp's OEIS frontend

A363941 Low median in the multiset of prime indices of n.

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

Offset: 1

Gus Wiseman, Jul 01 2023

nonn

The low median (see A124943) in a multiset is either the middle part (for odd length), or the least of the two middle parts (for even length).

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 90 are {1,2,2,3}, with low median 2, so a(90) = 2.
The prime indices of 150 are {1,2,3,3}, with low median 2, so a(150) = 2.

Positions of first appearances are 1 and A000040.
The triangle for this statistic (low median) is A124943, high A124944.
Median of prime indices is A360005(n)/2.
For mode instead of median we have A363486, high A363487.
Positions of 1's are A363488.
The high version is A363942.
A067538 counts partitions with integer mean, ranked by A316413.
A112798 lists prime indices, length A001222, sum A056239.
A363943 gives low mean of prime indices, triangle A363945.
A363944 gives high mean of prime indices, triangle A363946.
Cf. A025065, A215366, A326567/A326568, A344296, A359889, A359908, A363727, A363740.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
mell[y_]:=If[Length[y]==0,0, If[OddQ[Length[y]],y[[(Length[y]+1)/2]],y[[Length[y]/2]]]];
Table[mell[prix[n]],{n,30}]

A363949 Numbers whose prime indices have mean 1 when rounded down.

Original entry on oeis.org

2, 4, 6, 8, 12, 16, 18, 20, 24, 32, 36, 40, 48, 54, 56, 60, 64, 72, 80, 96, 108, 112, 120, 128, 144, 160, 162, 168, 176, 180, 192, 200, 216, 224, 240, 256, 288, 320, 324, 336, 352, 360, 384, 400, 416, 432, 448, 480, 486, 504, 512, 528, 540, 560, 576, 600, 640

Offset: 1

Gus Wiseman, Jul 02 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 terms together with their prime indices begin:
    2: {1}
    4: {1,1}
    6: {1,2}
    8: {1,1,1}
   12: {1,1,2}
   16: {1,1,1,1}
   18: {1,2,2}
   20: {1,1,3}
   24: {1,1,1,2}
   32: {1,1,1,1,1}
   36: {1,1,2,2}
   40: {1,1,1,3}
   48: {1,1,1,1,2}
   54: {1,2,2,2}
   56: {1,1,1,4}
   60: {1,1,2,3}
   64: {1,1,1,1,1,1}

These partitions are counted by A025065.
Before rounding down we had A326567/A326568.
For mode instead of mean we have A360015, counted by A241131.
For median instead of mean we have A363488, counted by A027336.
Positions of 1's in A363943, triangle A363945.
For the usual rounding (not low or high) we have A363948, counted by A363947.
A112798 lists prime indices, length A001222, sum A056239.
A316413 ranks partitions with integer mean, counted by A067538.
A360005 gives twice the median of prime indices.
A363941 gives low median of prime indices, triangle A124943.
A363942 gives high median of prime indices, triangle A124944.
For mean 2 instead of 1 we have A363950, counted by A026905 redoubled.
Cf. A051293, A327473, A327476, A344296, A359889, A360013, A363723, A363727, A363946, A363951.

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

a(n) = 2*A344296(n).

A359903 Numbers whose prime indices and prime signature have the same mean.

Original entry on oeis.org

1, 2, 9, 88, 100, 125, 624, 756, 792, 810, 880, 900, 1312, 2401, 4617, 4624, 6240, 7392, 7560, 7920, 8400, 9261, 9604, 9801, 10648, 12416, 23424, 33984, 37760, 45792, 47488, 60912, 66176, 71552, 73920, 75200, 78720, 83592, 89216, 89984, 91264, 91648, 99456

Offset: 1

Gus Wiseman, Jan 24 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.

A number's prime signature (row n of A124010) is the sequence of positive exponents in its prime factorization.

			The terms together with their prime indices begin:
      1: {}
      2: {1}
      9: {2,2}
     88: {1,1,1,5}
    100: {1,1,3,3}
    125: {3,3,3}
    624: {1,1,1,1,2,6}
    756: {1,1,2,2,2,4}
    792: {1,1,1,2,2,5}
    810: {1,2,2,2,2,3}
    880: {1,1,1,1,3,5}
    900: {1,1,2,2,3,3}
   1312: {1,1,1,1,1,13}
   2401: {4,4,4,4}
   4617: {2,2,2,2,2,8}
   4624: {1,1,1,1,7,7}
   6240: {1,1,1,1,1,2,3,6}
   7392: {1,1,1,1,1,2,4,5}
   7560: {1,1,1,2,2,2,3,4}
   7920: {1,1,1,1,2,2,3,5}
Example: 810 has prime indices {1,2,2,2,2,3} and prime exponents (1,4,1), both of which have mean 2, so 810 is in the sequence.
Example: 78720 has prime indices {1,1,1,1,1,1,1,2,3,13} and prime exponents (7,1,1,1), both of which have mean 5/2, so 78720 is in the sequence.

Prime indices are A112798, sum A056239, mean A326567/A326568.
Prime signature is A124010, sum A001222, mean A088529/A088530.
For prime factors instead of indices we have A359904.
Partitions with these Heinz numbers are counted by A360068.
A058398 counts partitions by mean, see also A008284, A327482.
A067340 lists numbers whose prime signature has integer mean.
A316413 lists numbers whose prime indices have integer mean.
A360005 gives median of prime indices (times two).
Cf. A240219, A316313, A326622, A327473, A327476, A348551, A359905, A359908, A360008, A360069.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
prisig[n_]:=If[n==1,{},Last/@FactorInteger[n]];
Select[Range[1000],Mean[prix[#]]==Mean[prisig[#]]&]

A360679 Sum of the right half (inclusive) of the prime indices of n.

Original entry on oeis.org

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

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 (inclusive) {2,2,3}, so a(810) = 7.
The prime indices of 3675 are {2,3,3,4,4}, with right half (inclusive) {3,4,4}, so a(3675) = 11.

Positions of first appearances are 1 and A001248.
The value k appears A360671(k) times, exclusive A360673.
These partitions are counted by A360672 with rows reversed.
The exclusive version is A360677.
The left version is A360678.
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. A026424, A359912, A360006, A360007, 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).

A361200 Product of the left half (exclusive) of the multiset of prime factors of n; a(1) = 0.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Mar 10 2023

nonn

			The prime factors of 250 are {2,5,5,5}, with left half (exclusive) {2,5}, with product 10, so a(250) = 10.

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

Positions of 1's are A000040.
Positions of 2's are A037143.
The inclusive version is A347043.
The right inclusive version A347044.
The right version is A361201.
A000005 counts divisors.
A001221 counts distinct prime factors.
A006530 gives greatest prime factor.
A112798 lists prime indices, length A001222, sum A056239.
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. A001248, A026424, A027746, A096825, A347045, A347046, A360005.

Table[If[n==1,0,Times@@Take[Join@@ConstantArray@@@FactorInteger[n],Floor[PrimeOmega[n]/2]]],{n,100}]
a[n_] := Module[{p = Flatten[Table[#[[1]], {#[[2]]}] & /@ FactorInteger[n]]}, Times @@ p[[1 ;; Floor[Length[p]/2]]]]; a[1] = 0; Array[a, 100] (* Amiram Eldar, Nov 02 2024 *)

a(n) * A347044(n) = n.
A361201(n) * A347043(n) = n.
a(n) = Product_{k=1..floor(A001222(n)/2)} A027746(n,k) for n >= 2. - Amiram Eldar, Nov 02 2024

A361201 Product of the right half (exclusive) of the multiset of prime factors of n; a(1) = 0.

Original entry on oeis.org

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

Offset: 1

Gus Wiseman, Mar 10 2023

			The prime factors of 250 are {2,5,5,5}, with right half (exclusive) {5,5}, with product 25, so a(250) = 25.

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

Positions of 1's are A000040.
Positions of first appearances are A123666.
The left inclusive version A347043.
The inclusive version is A347044.
The left version is A361200.
A000005 counts divisors.
A001221 counts distinct prime factors.
A006530 gives greatest prime factor.
A112798 lists prime indices, length A001222, sum A056239.
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. A001248, A026424, A096825, A347045, A347046, A360005.

f:= proc(n) local F;
  F:= ifactors(n)[2];
  F:= sort(map(t -> t[1]$t[2],F));
  convert(F[ceil(nops(F)/2)+1 ..-1],`*`)
end proc:
f(1):= 0:
map(f, [$1..100]); # Robert Israel, Aug 12 2024

Table[If[n==1,0,Times@@Take[Join@@ConstantArray@@@FactorInteger[n],-Floor[PrimeOmega[n]/2]]],{n,100}]

A361200(n) * A347044(n) = n.

A361201(n) * A347043(n) = n.

A231147 Array of coefficients of numerator polynomials of the rational function p(n, x + 1/x), where p(n,x) = (x^n - 1)/(x - 1).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 4, 3, 4, 1, 1, 1, 1, 5, 4, 9, 4, 5, 1, 1, 1, 1, 6, 5, 14, 9, 14, 5, 6, 1, 1, 1, 1, 7, 6, 20, 14, 29, 14, 20, 6, 7, 1, 1, 1, 1, 8, 7, 27, 20, 49, 29, 49, 20, 27, 7, 8, 1, 1, 1, 1, 9, 8, 35, 27, 76, 49, 99, 49, 76, 27, 35, 8, 9

Offset: 1

Clark Kimberling, Nov 05 2013

From Gus Wiseman, Mar 19 2023: (Start)
Also appears to be the number of nonempty subsets of {1,...,n} with median k, where k ranges from 1 to n in steps of 1/2, and the median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length). For example, row n = 5 counts the following subsets:
{1}  {1,2}  {2}      {1,4}      {3}          {2,5}      {4}      {4,5}  {5}
            {1,3}    {2,3}      {1,5}        {3,4}      {3,5}
            {1,2,3}  {1,2,3,4}  {2,4}        {1,3,4,5}  {1,4,5}
            {1,2,4}  {1,2,3,5}  {1,3,4}      {2,3,4,5}  {2,4,5}
            {1,2,5}             {1,3,5}                 {3,4,5}
                                {2,3,4}
                                {2,3,5}
                                {1,2,4,5}
                                {1,2,3,4,5}
Central diagonals T(n,(n+1)/2) appear to be A100066 (bisection A006134).
For mean instead of median we have A327481.
For partitions instead of subsets we have A359893, full steps A359901.
Central diagonals T(n,n/2) are A361801 (bisection A079309).
(End)

			Triangle begins:
  1
  1  1  1
  1  1  3  1  1
  1  1  4  3  4  1  1
  1  1  5  4  9  4  5  1  1
  1  1  6  5 14  9 14  5  6  1  1
  1  1  7  6 20 14 29 14 20  6  7  1  1
  1  1  8  7 27 20 49 29 49 20 27  7  8  1  1
  1  1  9  8 35 27 76 49 99 49 76 27 35  8  9  1  1
First 3 polynomials: 1, 1 + x + x^2, 1 + x + 3*x^2 + x^3 + x^4

John Tyler Rascoe, Rows n = 1..100, flattened

Cf. A231148.
Row sums are 2^n-1 = A000225(n).
Row lengths are 2n-1 = A005408(n-1).
Removing every other column appears to give A013580.
Cf. A006134, A007318, A008289, A079309, A325347, A327481, A359907, A360005.

z = 60; p[n_, x_] := p[x] = (x^n - 1)/(x - 1); Table[p[n, x], {n, 1, z/4}]; f1[n_, x_] := f1[n, x] = Numerator[Factor[p[n, x] /. x -> x + 1/x]]; Table[Expand[f1[n, x]], {n, 0, z/4}]
Flatten[Table[CoefficientList[f1[n, x], x], {n, 1, z/4}]]

A231147_row(n) = {Vecrev(Vec(numerator((-1+(x+(1/x))^n)/(x+(1/x)-1))))} \\ John Tyler Rascoe, Sep 10 2024

A360460 Two times the median of the unordered prime signature of n; a(1) = 1.

Original entry on oeis.org

1, 2, 2, 4, 2, 2, 2, 6, 4, 2, 2, 3, 2, 2, 2, 8, 2, 3, 2, 3, 2, 2, 2, 4, 4, 2, 6, 3, 2, 2, 2, 10, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 2, 3, 3, 2, 2, 5, 4, 3, 2, 3, 2, 4, 2, 4, 2, 2, 2, 2, 2, 2, 3, 12, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 3, 3, 2, 2, 2, 5, 8, 2, 2, 2, 2, 2, 2

Offset: 1

Gus Wiseman, Feb 14 2023

nonn

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length). Since the denominator is always 1 or 2, the median can be represented as an integer by multiplying by 2.

A number's unordered prime signature (row n of A118914) is the multiset of positive exponents in its prime factorization.

			The unordered prime signature of 2520 is {1,1,2,3}, with median 3/2, so a(2520) = 3.

The version for divisors is A063655.
For mean instead of two times median we have A088529/A088530.
Prime signature is A124010, unordered A118914.
The version for prime indices is A360005.
The version for distinct prime indices is A360457.
The version for distinct prime factors is A360458.
The version for prime factors is A360459.
Positions of even terms are A360553.
Positions of odd terms are A360554.
The version for 0-prepended differences is A360555.
A112798 lists prime indices, length A001222, sum A056239.
A304038 lists distinct prime indices.
A325347 counts partitions w/ integer median, complement A307683.
A329976 counts partitions with median multiplicity 1.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A000975, A026424, A133464, A359907, A359908, A360454.

Table[If[n==1,1,2*Median[Last/@FactorInteger[n]]],{n,100}]

A360676 Sum of the left half (exclusive) of the prime indices of n.

Original entry on oeis.org

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

Offset: 1

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

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

Positions of 0's are 1 and A000040.
Positions of first appearances are 1 and A001248.
These partitions are counted by A360675, right A360672.
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, A360674.

f:= proc(n) local F,i,t;
  F:= [seq(numtheory:-pi(t[1])$t[2], t = sort(ifactors(n)[2],(a,b) -> a[1] < b[1]))];
  add(F[i],i=1..floor(nops(F)/2))
end proc:
map(f, [$1..100]); # Robert Israel, Feb 02 2025

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}]

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

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

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

Original entry on oeis.org

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

cp's OEIS Frontend

A363941 Low median in the multiset of prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A363949 Numbers whose prime indices have mean 1 when rounded down.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A359903 Numbers whose prime indices and prime signature have the same mean.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A360679 Sum of the right half (inclusive) of the prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A361200 Product of the left half (exclusive) of the multiset of prime factors of n; a(1) = 0.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Formula

A361201 Product of the right half (exclusive) of the multiset of prime factors of n; a(1) = 0.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A231147 Array of coefficients of numerator polynomials of the rational function p(n, x + 1/x), where p(n,x) = (x^n - 1)/(x - 1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A360460 Two times the median of the unordered prime signature of n; a(1) = 1.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica