A060437 -id:A060437 - cp's OEIS frontend

A056239 If n = Product_{k >= 1} (p_k)^(c_k) where p_k is k-th prime and c_k >= 0 then a(n) = Sum_{k >= 1} k*c_k.

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

Offset: 1

Leroy Quet, Aug 19 2000

A pseudo-logarithmic function in the sense that a(b*c) = a(b)+a(c) and so a(b^c) = c*a(b) and f(n) = k^a(n) is a multiplicative function. [Cf. A248692 for example.] Essentially a function from the positive integers onto the partitions of the nonnegative integers (1->0, 2->1, 3->2, 4->1+1, 5->3, 6->1+2, etc.) so each value a(n) appears A000041(a(n)) times, first with the a(n)-th prime and last with the a(n)-th power of 2. Produces triangular numbers from primorials. - Henry Bottomley, Nov 22 2001
Michael Nyvang writes (May 08 2006) that the Danish composer Karl Aage Rasmussen discovered this sequence in the 1990's: it has excellent musical properties.
All A000041(a(n)) different n's with the same value a(n) are listed in row a(n) of triangle A215366. - Alois P. Heinz, Aug 09 2012
a(n) is the sum of the parts of the partition having Heinz number n. We define the Heinz number of a partition p = [p_1, p_2, ..., p_r] as Product_{j=1..r} (p_j-th prime) (concept used by Alois P. Heinz in A215366 as an "encoding" of a partition). For example, for the partition [1, 1, 2, 4, 10] we get 2*2*3*7*29 = 2436. Example: a(33) = 7 because the partition with Heinz number 33 = 3 * 11 is [2,5]. - Emeric Deutsch, May 19 2015

			a(12) = 1*2 + 2*1 = 4, since 12 = 2^2 *3^1 = (p_1)^2 *(p_2)^1.

N. J. A. Sloane, Table of n, a(n) for n = 1..10000
Index entries for sequences computed from indices in prime factorization

Row sums of A112798.
Cf. A003963 (gives the corresponding products).
Cf. also A000041, A000217, A000720, A001221, A001222, A002110, A005940, A008475, A027748, A049084, A060437, A081401, A082090, A088314, A088318, A088850, A088880, A088881, A088887, A088902, A108951, A122111, A124010, A127668, A141128, A153734, A154351, A156552, A163517, A178503, A215366, A215369, A215501, A242422, A242423, A242424, A243070, A243353, A243354, A243503, A248692, A249336, A249337, A329605, A329902.

a056239 n = sum $ zipWith (*) (map a049084 $ a027748_row n) (a124010_row n)
-- Reinhard Zumkeller, Apr 27 2013

# To get 10000 terms. First make prime table: M:=10000; pl:=array(1..M); for i from 1 to M do pl[i]:=0; od: for i from 1 to M do if ithprime(i) > M then break; fi; pl[ithprime(i)]:=i; od:
# Decode Maple's amazing syntax for factoring integers: g:=proc(n) local e,p,t1,t2,t3,i,j,k; global pl; t1:=ifactor(n); t2:=nops(t1); if t2 = 2 and whattype(t1) <> `*` then p:=op(1,op(1,t1)); e:=op(2,t1); t3:=pl[p]*e; else
t3:=0; for i from 1 to t2 do j:=op(i,t1); if nops(j) = 1 then e:=1; p:=op(1,j); else e:=op(2,j); p:=op(1,op(1,j)); fi; t3:=t3+pl[p]*e; od: fi; t3; end; # N. J. A. Sloane, May 10 2006
A056239 := proc(n) add( numtheory[pi](op(1,p))*op(2,p), p = ifactors(n)[2]) ; end proc: # R. J. Mathar, Apr 20 2010
# alternative:
with(numtheory): a := proc (n) local B: B := proc (n) local nn, j, m: nn := op(2, ifactors(n)): for j to nops(nn) do m[j] := op(j, nn) end do: [seq(seq(pi(op(1, m[i])), q = 1 .. op(2, m[i])), i = 1 .. nops(nn))] end proc: add(B(n)[i], i = 1 .. nops(B(n))) end proc: seq(a(n), n = 1 .. 130); # Emeric Deutsch, May 19 2015

a[1] = 0; a[2] = 1; a[p_?PrimeQ] := a[p] = PrimePi[p];
a[n_] := a[n] = Total[#[[2]]*a[#[[1]]] & /@ FactorInteger[n]]; a /@ Range[91] (* Jean-François Alcover, May 19 2011 *)
Table[Total[FactorInteger[n] /. {p_, c_} /; p > 0 :> PrimePi[p] c], {n, 91}] (* Michael De Vlieger, Jul 12 2017 *)

A056239(n) = if(1==n,0,my(f=factor(n)); sum(i=1, #f~, f[i,2] * primepi(f[i,1]))); \\ Antti Karttunen, Oct 26 2014, edited Jan 13 2020

from sympy import primepi, factorint
def A056239(n): return sum(primepi(p)*e for p, e in factorint(n).items()) # Chai Wah Wu, Jan 01 2023

(require 'factor) ;; Uses the function factor available in Aubrey Jaffer's SLIB Scheme library.
(define (A056239 n) (apply + (map A049084 (factor n))))
;; Antti Karttunen, Oct 26 2014

Totally additive with a(p) = PrimePi(p), where PrimePi(n) = A000720(n).
a(n) = Sum_{k=1..A001221(n)} A049084(A027748(k))*A124010(k). - Reinhard Zumkeller, Apr 27 2013
From Antti Karttunen, Oct 11 2014: (Start)
a(n) = n - A178503(n).
a(n) = A161511(A156552(n)).
a(n) = A227183(A243354(n)).
For all n >= 0:
a(A002110(n)) = A000217(n). [Cf. Henry Bottomley's comment above.]
a(A005940(n+1)) = A161511(n).
a(A243353(n)) = A227183(n).
Also, for all n >= 1:
a(A241909(n)) = A243503(n).
a(A122111(n)) = a(n).
a(A242424(n)) = a(n).
A248692(n) = 2^a(n). (End)
a(n) < A329605(n), a(n) = A001222(A108951(n)), a(A329902(n)) = A112778(n). - Antti Karttunen, Jan 14 2020

A060240 Triangle T(n,k) in which n-th row gives degrees of irreducible representations of symmetric group S_n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 3, 3, 1, 1, 4, 4, 5, 5, 6, 1, 1, 5, 5, 5, 5, 9, 9, 10, 10, 16, 1, 1, 6, 6, 14, 14, 14, 14, 15, 15, 20, 21, 21, 35, 35, 1, 1, 7, 7, 14, 14, 20, 20, 21, 21, 28, 28, 35, 35, 42, 56, 56, 64, 64, 70, 70, 90, 1, 1, 8, 8, 27, 27, 28, 28, 42, 42, 42, 48, 48, 56, 56, 70, 84

Offset: 0

N. J. A. Sloane, Mar 21 2001

Sum_{k>=1} T(n,k)^2 = n!. - R. J. Mathar, May 09 2013
From Emeric Deutsch, Oct 31 2014: (Start)
Number of entries in row n = A000041(n) = number of partitions of n.
Sum of entries in row n = A000085(n).
Largest (= last) entry in row n = A003040(n).
The entries in row n give the number of standard Young tableaux of the Ferrers diagrams of the partitions of n (nondecreasingly). (End)

			Triangle begins:
  1;
  1;
  1, 1;
  1, 1, 2;
  1, 1, 2, 3, 3;
  1, 1, 4, 4, 5, 5, 6;
  ...

J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, ATLAS of Finite Groups, Oxford Univ. Press, 1985.
B. E. Sagan, The Symmetric Group, 2nd ed., Springer, 2001, New York.

Alois P. Heinz, Rows n = 0..36, flattened
J. S. Frame, G. de B. Robinson, and R. M. Thrall, The hook graphs of the symmetric group Canad. J. Math, 6:316-324, 1954. See Theorem 1, p. 318.
Index entries for sequences related to groups

Rows give A003870, A003871, etc. Cf. A060241, A060246, A060247.
Maximal entry in each row gives A003040.
Cf. A000041, A000085, A000142, A060437, A093784, A224653.

CharacterTable(SymmetricGroup(6)); // (say)

h:= proc(l) local n; n:= nops(l); add(i, i=l)!/mul(mul(1+l[i]-j+
      add(`if`(l[k]>=j, 1, 0), k=i+1..n), j=1..l[i]), i=1..n) end:
g:= (n, i, l)-> `if`(n=0 or i=1, h([l[], 1$n]), `if`(i<1, 0,
                 seq(g(n-i*j, i-1, [l[], i$j]), j=0..n/i))):
T:= n-> sort([g(n, n, [])])[]:
seq(T(n), n=0..10);  # Alois P. Heinz, Jan 07 2013

h[l_List] := With[{n = Length[l]}, Total[l]!/Product[Product[1+l[[i]]-j + Sum[If[l[[k]] >= j, 1, 0], {k, i+1, n}], {j, 1, l[[i]]}], {i, 1, n}]];
g[n_, i_, l_List] := If[n == 0 || i == 1, h[Join[l, Array[1&, n]]], If[i<1, 0, Flatten @ Table[g[n-i*j, i-1, Join[l, Array[i&, j]]], {j, 0, n/i}]]];
T[n_] := Sort[g[n, n, {}]]; T[1] = {1};
Table[T[n], {n, 1, 10}] // Flatten (* Jean-François Alcover, Jan 27 2014, after Alois P. Heinz *)

More terms from Vladeta Jovovic, May 20 2003

A060426 a(n) is the number of degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n that appear only once.

Original entry on oeis.org

1, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 3, 2, 3, 4, 4, 5, 5, 4, 6, 8, 8, 6, 7, 10, 11, 11, 15, 15, 16, 18, 21, 22, 23, 29, 33, 31, 31, 39, 43, 44, 52, 51, 58, 64, 71, 66, 82, 88, 96, 93, 103, 115, 128, 143, 150, 156, 160, 173, 199, 202, 202, 242, 263, 269, 293, 308

Offset: 1

Avi Peretz (njk(AT)netvision.net.il), Apr 05 2001

nonn

Bounded above by A000700(n). - Eric M. Schmidt, Apr 29 2013

			a(6) = 1 because the degrees for S_6 are 1,1,5,5,5,5,9,9,10,10,16 and the only number that appears once is 16.

Cf. A059867, A060368, A060369, A060437, A061569, A089248. [From M. F. Hasler, Jun 14 2009]

h[l_] := With[{n = Length[l]}, Total[l]!/Product[Product[1 + l[[i]] - j + Sum[If[l[[k]] >= j, 1, 0], {k, i + 1, n}], {j, 1, l[[i]]}], {i, 1, n}]];
g[n_, i_, l_] := If[n == 0 || i == 1, h[Join[l, Array[1&, n]]], If[i < 1, 0, Flatten@ Table[g[n - i*j, i - 1, Join[l, Array[i&, j]]], {j, 0, n/i}]]];
a[n_] := a[n] = If[n == 1, 1, Count[Tally[g[n, n, {}]], {_, 1}] ];
Table[Print[n, " ", a[n]]; a[n], {n, 1, 50}] (* Jean-François Alcover, Sep 23 2024, after Alois P. Heinz in A060240 *)

def A060426(n) :
    mult = {}
    for P in Partitions(n) :
        dim = P.dimension()
        mult[dim] = mult.get(dim, 0) + 1
    return len([m for m in iter(mult) if mult[m]==1])
# Eric M. Schmidt, Apr 29 2013

More terms from Eric M. Schmidt, Apr 29 2013

A154351 a(n) = number of distinct values of A056239(m) when A153452(m) is equal to n.

Original entry on oeis.org

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

Offset: 2

Naohiro Nomoto, Jan 07 2009

Cf. A060437.

A318558 Number of degrees of irreducible representations of symmetric group S_n that appear more than once.

Original entry on oeis.org

0, 0, 1, 1, 2, 3, 4, 6, 10, 14, 20, 26, 35, 43, 49, 77, 103, 125, 174, 190, 274, 340, 430, 496, 686, 838, 1026, 1263, 1579, 1832, 2457, 2833, 3631, 4249, 5114, 6111, 7962, 9072, 11015, 12939, 16173, 18304, 23101, 26188, 31822, 37518, 45073, 51403, 63489, 71822

Offset: 0

Pierandrea Formusa, Aug 28 2018

nonn

			Number 4 has the following partitions: a) [4], b) [3, 1], c) [2, 2], d) [2, 1, 1], e) [1, 1, 1, 1]. For partition a the cardinality of standard Young tableaux is 1, for b 3, for c 2, for d 3 and for e 1, so multiple cardinalities are 1 and 3: two multiple cardinalities, i.e., 4th sequence element is 2.

Cf. A060240, A060426, A060437.

h[l_] := With[{n = Length[l]}, Total[l]!/Product[Product[1 + l[[i]] - j + Sum[If[l[[k]] >= j, 1, 0], {k, i + 1, n}], {j, 1, l[[i]]}], {i, 1, n}]];
g[n_, i_, l_] := If[n == 0 || i == 1, h[Join[l, Array[1&, n]]], If[i < 1, 0, Flatten@ Table[g[n - i*j, i - 1, Join[l, Array[i&, j]]], {j, 0, n/i}]]];
a[n_] := a[n] = If[n == 0 || n == 1, 0, Count[Tally[g[n, n, {}]], {, k /; k > 1}] ];
Table[Print[n, " ", a[n]]; a[n], {n, 0, 49}] (* Jean-François Alcover, Sep 23 2024, after Alois P. Heinz in A060240 *)

r=""
lista=[]
lista_rip=[]
rip=0
for i in range(1,35):
        l=Partitions(i)
        for p in l:
            nsc=StandardTableaux(p).cardinality()
            if nsc in lista:
                if nsc not in lista_rip:
                    lista_rip.append(nsc)
                    rip += 1
            else:
                lista.append(nsc)
        r = r+","+str(rip)
        rip=0
        lista=[]
        lista_rip=[]
print(r)

a(n) = A060437(n) - A060426(n). - Alois P. Heinz, Aug 29 2018

a(42)-a(49) from Alois P. Heinz, Aug 29 2018

cp's OEIS Frontend

A056239 If n = Product_{k >= 1} (p_k)^(c_k) where p_k is k-th prime and c_k >= 0 then a(n) = Sum_{k >= 1} k*c_k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

Python

Scheme

Formula

A060240 Triangle T(n,k) in which n-th row gives degrees of irreducible representations of symmetric group S_n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

Extensions

A060426 a(n) is the number of degrees in the sequence of the degrees of the irreducible representations of the symmetric group S_n that appear only once.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Sage

Extensions

A154351 a(n) = number of distinct values of A056239(m) when A153452(m) is equal to n.

Views

Author

Keywords

Crossrefs

A318558 Number of degrees of irreducible representations of symmetric group S_n that appear more than once.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

SageMath

Formula

Extensions