cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-5 of 5 results.

A024816 Antisigma(n): Sum of the numbers less than n that do not divide n.

Original entry on oeis.org

0, 0, 2, 3, 9, 9, 20, 21, 32, 37, 54, 50, 77, 81, 96, 105, 135, 132, 170, 168, 199, 217, 252, 240, 294, 309, 338, 350, 405, 393, 464, 465, 513, 541, 582, 575, 665, 681, 724, 730, 819, 807, 902, 906, 957, 1009, 1080, 1052, 1168, 1182, 1254, 1280, 1377, 1365
Offset: 1

Views

Author

Paul Jobling (paul.jobling(AT)whitecross.com)

Keywords

Comments

a(n) is the sum of proper non-divisors of n, the row sum in triangle A173541. - Omar E. Pol, May 25 2010
a(n) is divisible by A000203(n) iff n is in A076617. - Bernard Schott, Apr 12 2022

Examples

			a(12)=50 as 5+7+8+9+10+11 = 50 (1,2,3,4,6 not included as they divide 12).
		

Crossrefs

Cf. A342344 (for a symmetric representation).

Programs

  • Haskell
    a024816 = sum . a173541_row  -- Reinhard Zumkeller, Feb 19 2014
    
  • Magma
    [n*(n+1) div 2- SumOfDivisors(n): n in [1..60]]; // Vincenzo Librandi, Dec 29 2015
    
  • Maple
    A024816 := proc(n)
        n*(n+1)/2-numtheory[sigma](n) ;
    end proc: # R. J. Mathar, Aug 03 2013
  • Mathematica
    Table[n(n + 1)/2 - DivisorSigma[1, n], {n, 55}] (* Robert G. Wilson v *)
    Table[Total[Complement[Range[n],Divisors[n]]],{n,60}] (* Harvey P. Dale, Sep 23 2012 *)
    With[{nn=60},#[[1]]-#[[2]]&/@Thread[{Accumulate[Range[nn]],DivisorSigma[ 1,Range[nn]]}]] (* Harvey P. Dale, Nov 22 2014 *)
  • PARI
    a(n)=n*(n+1)/2-sigma(n) \\ Charles R Greathouse IV, Mar 19 2012
    
  • Python
    from sympy import divisor_sigma
    def A024816(n): return (n*(n+1)>>1)-divisor_sigma(n) # Chai Wah Wu, Apr 28 2023
    
  • SageMath
    def A024816(n): return sum(k for k in (0..n-1) if not k.divides(n))
    print([A024816(n) for n in srange(1, 55)])  # Peter Luschny, Nov 14 2023

Formula

a(n) = n*(n+1)/2 - sigma(n) = A000217(n) - A000203(n).
a(n) = A024916(n-1) - A153485(n), n > 1. - Omar E. Pol, Jun 24 2014
From Wesley Ivan Hurt, Jul 16 2014, Dec 28 2015: (Start)
a(n) = Sum_{i=1..n} i * ( ceiling(n/i) - floor(n/i) ).
a(n) = Sum_{k=1..n} (n mod k) + (-n mod k). (End)
G.f.: x/(1 - x)^3 - Sum_{k>=1} k*x^k/(1 - x^k). - Ilya Gutkovskiy, Sep 18 2017
From Omar E. Pol, Mar 21 2021: (Start)
a(n) = A244048(n) + A004125(n).
a(n) = A153485(n-1) + A004125(n), n >= 2. (End)
a(p) = (p-2)*(p+1)/2 for p prime. - Bernard Schott, Apr 12 2022

A153485 Sum of all aliquot divisors of all positive integers <= n.

Original entry on oeis.org

0, 1, 2, 5, 6, 12, 13, 20, 24, 32, 33, 49, 50, 60, 69, 84, 85, 106, 107, 129, 140, 154, 155, 191, 197, 213, 226, 254, 255, 297, 298, 329, 344, 364, 377, 432, 433, 455, 472, 522, 523, 577, 578, 618, 651, 677, 678, 754, 762, 805, 826
Offset: 1

Views

Author

Omar E. Pol, Dec 27 2008

Keywords

Comments

a(n) is also the sum of first n terms of A000203, minus n-th triangular number.
n is prime if and only if a(n) - a(n-1) = 1. - Omar E. Pol, Dec 31 2012
Also the alternating row sums of A236540. - Omar E. Pol, Jun 23 2014
Sum of the areas of all x X z rectangles with x and y integers, x + y = n, x <= y and z = floor(y/x). - Wesley Ivan Hurt, Dec 21 2020
Apart from the symmetric representation of a(n) given in the Example section we have that a(n) can be represented with an arrowhead-shaped polygon formed by two zig-zag paths and the Dyck path described in the n-th row of A237593 as shown in the Links section. - Omar E. Pol, Jun 13 2022

Examples

			Assuming that a(1) = 0, for n = 6 the aliquot divisors of the first six positive integers are [0], [1], [1], [1, 2], [1], [1, 2, 3], so a(6) = 0 + 1 + 1 + 1 + 2 + 1 + 1 + 2 + 3 = 12.
From _Omar E. Pol_, Mar 27 2021: (Start)
The following diagrams show a square dissection into regions that are the symmetric representation of A000203, A004125, A244048 and this sequence.
In order to construct every diagram we use the following rules:
At stage 1 in the first quadrant of the square grid we draw the symmetric representation of sigma(n) using the two Dyck paths described in the rows n and n-1 of A237593.
At stage 2 we draw a pair of orthogonal line segments (if it's necessary) such that in the drawing appears totally formed a square n X n. The area of the region that is above the symmetric representation of sigma(n) equals A004125(n).
At stage 3 we draw a zig-zag path with line segments of length 1 from (0,n-1) to (n-1,0) such that appears a staircase with n-1 steps. The area of the region (or regions) that is below the symmetric representation of sigma(n) and above the staircase equals A244048(n).
At stage 4 we draw a copy of the symmetric representation of A004125(n) rotated 180 degrees such that one of its vertices is the point (0,0). a(n) is the area of the region (or regions) that is above of this region and below the staircase.
Illustration for n = 1..6:
.                                                                    _ _ _ _ _ _
.                                                     _ _ _ _ _     |_ _ _  |_ R|
.                                        _ _ _ _ R   |_ _S_|  R|    | |_T | S |_|
.                             _ _ _ R   |_ _  |_|    | |_  |_ _|    |   |_|_ _  |
.                    _ _     |_S_|_|    | |_|_S |    |_U_|_T | |    |_  U |_T | |
.             _ S   |_ S|   U|_|_|S|    |_ U|_| |    |   | |_|S|    | |_    |_| |
.            |_|    |_|_|    |_|_|_|    |_|_ _|_|    |_V_|_U_|_|    |_V_|_ _ _|_|
.                  U        V   U       V
.
n:            1       2         3           4             5               6
R: A004125    0       0         1           1             4               3
S: A000203    1       3         4           7             6              12
T: A244048    0       0         1           2             5               6
U: a(n)       0       1         2           5             6              12
V: A004125    0       0         1           1             4               3
.
Illustration for n = 7..9:
.                                                      _ _ _ _ _ _ _ _ _
.                                _ _ _ _ _ _ _ _      |_ _ _S_ _|       |
.            _ _ _ _ _ _ _      |_ _ _ _  |     |     | |_      |_ _ R  |
.           |_ _S_ _|     |     | |_    | |_ R  |     |   |_    |_ S|   |
.           | |_    |_ R  |     |   |_  |_S |_ _|     |     |_  T |_|_ _|
.           |   |_  T |_ _|     |     |_T |_ _  |     |_ _    |_      | |
.           |_ _  |_    | |     |_ _  U |_    | |     |   |  U  |_    | |
.           |   |_U |_  |S|     |   |_    |_  | |     |   |_ _    |_  |S|
.           |  V  |   |_| |     |  V  |     |_| |     |  V    |     |_| |
.           |_ _ _|_ _ _|_|     |_ _ _|_ _ _ _|_|     |_ _ _ _|_ _ _ _|_|
.
n:                 7                    8                      9
R: A004125         8                    8                     12
S: A000203         8                   15                     12
T: A244048        12                   13                     20
U: a(n)           13                   20                     24
V: A004125         8                    8                     12
.
Illustration for n = 10..12:
.                                                         _ _ _ _ _ _ _ _ _ _ _ _
.                              _ _ _ _ _ _ _ _ _ _ _     |_ _ _ _ _ _  |         |
.     _ _ _ _ _ _ _ _ _ _     |_ _ _S_ _ _|         |    | |_        | |_ _   R  |
.    |_ _ _S_ _  |       |    | |_        |      R  |    |   |_      |     |_    |
.    | |_      | |_  R   |    |   |_      |_        |    |     |_    |_  S   |   |
.    |   |_    |_ _|_    |    |     |_      |_      |    |       |_    |_    |_ _|
.    |     |_      | |_ _|    |       |_   T  |_ _ _|    |         |_ T  |_ _ _  |
.    |       |_ T  |_ _  |    |_ _ _    |_        | |    |_ _        |_        | |
.    |_ _      |_      | |    |     |_ U  |_      | |    |   |    U    |_      | |
.    |   |_ U    |_    |S|    |       |_    |_    |S|    |   |_          |_    | |
.    |     |_      |_  | |    |         |     |_  | |    |     |_ _        |_  | |
.    |  V    |       |_| |    |  V      |       |_| |    |  V      |         |_| |
.    |_ _ _ _|_ _ _ _ _|_|    |_ _ _ _ _|_ _ _ _ _|_|    |_ _ _ _ _|_ _ _ _ _ _|_|
.
n:            10                         11                          12
R: A004125    13                         22                          17
S: A000203    18                         12                          28
T: A244048    24                         32                          33
U: a(n)       32                         33                          49
V: A004125    13                         22                          17
.
Note that in the diagrams the symmetric representation of A244048(n+1) is the same as the symmetric representation of a(n) rotated 180 degrees.
The diagrams for n = 11 and n = 12 both are copies from the diagrams that are in A244048 dated Jun 24 2014.
[Another way for the illustration of this sequence which is visible in the pyramid described in A245092 will be added soon.]
(End)
		

Crossrefs

Programs

  • Mathematica
    f[n_] := Sum[ DivisorSigma[1, m] - m, {m, n}]; Array[f, 60] (* Robert G. Wilson v, Jun 30 2014 *)
    Accumulate@ Table[DivisorSum[n, # &, # < n &], {n, 51}] (* or *)
    Table[Sum[k Floor[(n - k)/k], {k, n}], {n, 51}] (* Michael De Vlieger, Apr 02 2017 *)
  • PARI
    a(n) = sum(k=1, n, sigma(k)-k); \\ Michel Marcus, Jan 22 2017
    
  • Python
    from math import isqrt
    def A153485(n): return (-n*(n+1)-(s:=isqrt(n))**2*(s+1) + sum((q:=n//k)*((k<<1)+q+1) for k in range(1,s+1)))>>1 # Chai Wah Wu, Oct 21 2023

Formula

a(n) = A024916(n) - A000217(n).
a(n) = A000217(n-1) - A004125(n). - Omar E. Pol, Jan 28 2014
a(n) = A000290(n) - A000203(n) - A024816(n) - A004125(n) = A024816(n+1) - A004125(n+1). - Omar E. Pol, Jun 23 2014
G.f.: (1/(1 - x))*Sum_{k>=1} k*x^(2*k)/(1 - x^k). - Ilya Gutkovskiy, Jan 22 2017
a(n) = Sum_{k=1..n} k * floor((n-k)/k). - Wesley Ivan Hurt, Apr 02 2017
a(n) ~ n^2 * (Pi^2/12 - 1/2). - Vaclav Kotesovec, Dec 21 2020
a(n) = A000290(n) - A000217(n) - A004125(n). - Omar E. Pol, Feb 26 2021
a(n) = A244048(n+1). - Omar E. Pol, Mar 28 2021

Extensions

Better name from Omar E. Pol, Jan 28 2014, Jun 23 2014

A294016 a(n) = sum of all divisors of all positive integers <= n, minus the sum of remainders of n mod k, for k = 1, 2, 3, ..., n.

Original entry on oeis.org

1, 4, 7, 14, 17, 30, 33, 48, 57, 74, 77, 110, 113, 134, 153, 184, 187, 230, 233, 278, 301, 330, 333, 406, 419, 452, 479, 536, 539, 624, 627, 690, 721, 762, 789, 900, 903, 948, 983, 1084, 1087, 1196, 1199, 1280, 1347, 1400, 1403, 1556, 1573, 1660, 1703, 1796, 1799, 1932, 1967, 2096, 2143, 2208, 2211, 2428, 2431, 2500
Offset: 1

Views

Author

Omar E. Pol, Oct 22 2017

Keywords

Comments

a(n) is also the area (also the number of cells) of the n-th polygon formed by the Dyck path described in A237593 and its mirror, as shown below in the example.
a(n) is also the volume (and the number of cubes) in the n-th level (starting from the top) of the pyramid described in A294017.

Examples

			Illustration of initial terms:
.
.   _ 1
.  |_|_ _ 4
.    |   |
.    |_ _|_ _   7
.        |   |_
.        |_    |
.          |_ _|_ _ _  14
.              |     |_
.              |       |
.              |_      |
.                |_ _ _|_ _ _
.                      |     |  17
.                      |     |_ _
.                      |_ _      |
.                          |     |
.                          |_ _ _|_ _ _ _
.                                |       |_  30
.                                |         |_
.                                |           |
.                                |_          |
.                                  |_        |
.                                    |_ _ _ _|_ _ _ _
.                                            |       |
.                                            |       |_  33
.                                            |         |_ _
.                                            |_ _          |
.                                                |_        |
.                                                  |       |
.                                                  |_ _ _ _|
.
		

Crossrefs

Programs

  • Maple
    A294016 := proc(n)
        A024916(n)-A004125(n) ;
    end proc:
    seq(A294016(n),n=1..80) ; # R. J. Mathar, Nov 07 2017
  • Mathematica
    Accumulate[Table[2*(DivisorSigma[1, n] - n) + 1, {n, 1, 100}]] (* Amiram Eldar, Mar 30 2024 *)
  • Python
    from math import isqrt
    def A294016(n): return -(s:=isqrt(n))**2*(s+1)+sum((q:=n//k)*((k<<1)+q+1) for k in range(1,s+1))-n**2 # Chai Wah Wu, Oct 22 2023

Formula

a(n) = A024916(n) - A004125(n).
a(n) = A000290(n) - A067436(n).
From Omar E. Pol, Nov 05 2017: (Start)
a(n) = A000203(n) + A024816(n) + A153485(n) - A004125(n).
a(n) = A000217(n) + A153485(n) - A004125(n).
a(n) = A000203(n) + A153485(n) + A244048(n). (End)
a(n) = (Pi^2/6 - 1) * n^2 + O(n*log(n)). - Amiram Eldar, Mar 30 2024

A235799 a(n) = n^2 - sigma(n).

Original entry on oeis.org

0, 1, 5, 9, 19, 24, 41, 49, 68, 82, 109, 116, 155, 172, 201, 225, 271, 285, 341, 358, 409, 448, 505, 516, 594, 634, 689, 728, 811, 828, 929, 961, 1041, 1102, 1177, 1205, 1331, 1384, 1465, 1510, 1639, 1668, 1805, 1852, 1947, 2044, 2161, 2180, 2344, 2407
Offset: 1

Views

Author

Omar E. Pol, Jan 24 2014

Keywords

Comments

From Omar E. Pol, Apr 11 2021: (Start)
If n is prime (A000040) then a(n) = n^2 - n - 1.
If n is a power of 2 (A000079) then a(n) = (n-1)^2.
If n is a perfect number (A000396) then a(n) = (n-1)^2 - 1, assuming there are no odd perfect numbers.
In order to construct the diagram of the symmetric representation of a(n) we use the following rules:
At stage 1 in the first quadrant of the square grid we draw the symmetric representation of sigma(n) using the two Dyck paths described in the rows n and n-1 of A237593. The area of the region that is below the symmetric representation of sigma(n) equals A024916(n-1).
At stage 2 we draw a pair of orthogonal line segments (if it's necessary) such that in the drawing appears totally formed a square n X n. The area of the region that is above the symmetric representation of sigma(n) equals A004125(n).
At stage 3 we turn OFF the cells of the symmetric representation of sigma(n). Then we turn ON the rest of the cells that are in the square n X n. The result is that the ON cell form the diagram of the symmetric representation of a(n). See the Example section. (End)

Examples

			From _Omar E. Pol, Apr 04 2021: (Start)
Illustration of initial terms in the first quadrant for n = 1..6:
.
.                                                             y|        _ _
.                                              y|      _ _     |_ _ _  |_  |
.                                 y|      _     |_ _ _|   |    |     |   |_|
.                      y|    _     |_ _  |_|    |        _|    |     |_ _
.             y|        |_ _|_|    |   |_       |       |      |         |
.      y|      |_       |   |      |     |      |       |      |         |
.       |_ _   |_|_ _   |_ _|_ _   |_ _ _|_ _   |_ _ _ _|_ _   |_ _ _ _ _|_ _
.          x        x          x            x              x                x
.
n:        1       2         3           4             5               6
a(n):     0       1         5           9            19              24
.
Illustration of initial terms in the first quadrant for n = 7..9:
.                                                y|          _ _ _ _
.                          y|          _ _ _      |_ _ _ _ _|       |
.      y|        _ _ _      |_ _ _ _  |     |     |          _ _    |
.       |_ _ _ _|     |     |       | |_    |     |         |_  |   |
.       |             |     |       |_  |_ _|     |           |_|  _|
.       |            _|     |         |_ _        |               |
.       |           |       |             |       |               |
.       |           |       |             |       |               |
.       |           |       |             |       |               |
.       |_ _ _ _ _ _|_ _    |_ _ _ _ _ _ _|_ _    |_ _ _ _ _ _ _ _|_ _
.                      x                     x                       x
.
n:              7                    8                      9
a(n):          41                   49                     68
.
For n = 9 the figures 1, 2 and 3 below show respectively the three stages described in the Comments section as follows:
.
.   y|_ _ _ _ _ 5            y|_ _ _ _ _ _ _ _ _      y|          _ _ _ _
.    |_ _ _ _ _|              |_ _ _ _ _|       |      |_ _ _ _ _|       |
.    |         |_ _ 3         |         |_ _ R  |      |          _ _    |
.    |         |_  |          |         |_  |   |      |         |_  |   |
.    |           |_|_ _ 5     |           |_|_ _|      |           |_|  _|
.    |               | |      |               | |      |               |
.    |      Q        | |      |       Q       | |      |               |
.    |               | |      |               | |      |               |
.    |               | |      |               | |      |               |
.    |_ _ _ _ _ _ _ _|_|_     |_ _ _ _ _ _ _ _|_|_     |_ _ _ _ _ _ _ _|_ _
.                       x                        x                        x
.         Figure 1.                Figure 2.                Figure 3.
.         Symmetric                Symmetric                Symmetric
.       representation           representation           representation
.         of sigma(9)              of sigma(9)             of a(9) = 68
.       A000203(9) = 13          A000203(9) = 13
.           and of                   and of
.     Q = A024916(8) = 56      R = A004125(9) = 12
.                              Q = A024916(8) = 56
.
Note that the symmetric representation of a(9) contains a hole formed by three cells because these three cells were the central part of the symmetric representation of sigma(9). (End)
		

Crossrefs

Programs

  • Magma
    [n^2 - DivisorSigma(1,n): n in [1..50]]; // G. C. Greubel, Oct 31 2018
  • Mathematica
    Table[n^2-DivisorSigma[1,n],{n,50}] (* Harvey P. Dale, Sep 02 2016 *)
  • PARI
    vector(50, n, n^2 - sigma(n)) \\ G. C. Greubel, Oct 31 2018
    

Formula

a(n) = A000290(n) - A000203(n).
a(n) = A024916(n-1) + A004125(n), n > 1.
G.f.: x*(1 + x)/(1 - x)^3 - Sum_{k>=1} x^k/(1 - x^k)^2. - Ilya Gutkovskiy, Mar 17 2017
From Omar E. Pol, Apr 10 2021: (Start)
a(n) = A024816(n) + A000217(n-1).
a(n) = A067436(n) + A153485(n) + A244048(n). (End)

A342344 Number of parts in the symmetric representation of antisigma(n).

Original entry on oeis.org

0, 0, 2, 3, 1, 3, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2
Offset: 1

Views

Author

Omar E. Pol, Mar 08 2021

Keywords

Comments

In order to construct this sequence and the diagram of the symmetric representation of antisigma(n) = A024816(n) we use the following rules:
At stage 1 in the first quadrant of the square grid we draw the symmetric representation of sigma(n) using the two Dyck paths described in the rows n and n-1 of A237593. The area of the region that is below the symmetric representation of sigma(n) equals A024916(n-1).
At stage 2 we draw a pair of orthogonal line segments (if it's necessary) such that in the drawing appears totally formed a square n X n. The area of the region that is above the symmetric representation of sigma(n) equals A004125(n). Then we draw a zig-zag path with line segments of length 1 from (0,n-1) to (n-1,0) such that appears a staircase with n-1 steps. The area of the region (or regions) that is below the symmetric representation of sigma(n) and above the staircase equals A244048(n) = A153485(n-1). The area of the region that is below the staircase equals A000217(n-1).
At stage 3 we turn OFF the cells of the symmetric representation of sigma(n) and also the cells that are below the staircase. Then we turn ON the rest of the cells that are in the square n X n. The result is that the ON cell form the diagram of the symmetric representation of antisigma(n) = A024816(n). See the Example section.
For n >= 7; if A237271(n) = 1 or n is a term of A262259 then a(n) = 2 otherwise a(n) = 1.

Examples

			Illustration of the symmetric representation of antisigma(n) = AS(n) = A024816(n), for n = 1..6:
.                                                             y|        _ _
.                                              y|      _ _     |  _ _  |_  |
.                                 y|      _     |  _ _|   |    | |_  |   |_|
.                      y|    _     |  _  |_|    | |_     _|    |   |_|_ _
.             y|        |  _|_|    | |_|_       |   |_  |      |     |_  |
.      y|      |        | |_|      |   |_|      |     |_|      |       |_|
.       |_ _   |_ _ _   |_ _ _ _   |_ _ _ _ _   |_ _ _ _ _ _   |_ _ _ _ _ _ _
.          x        x          x            x              x                x
.
n:        1       2         3           4             5               6
a(n):     0       0         2           3             1               3
AS(n):    0       0         2           3             9               9
.
Illustration of the symmetric representation of antisigma(n) = AS(n) = A024816(n), for n = 7..9:
.                                                y|          _ _ _ _
.                          y|          _ _ _      |  _ _ _ _|       |
.      y|        _ _ _      |  _ _ _  |     |     | |_       _ _    |
.       |  _ _ _|     |     | |_    | |_    |     |   |_    |_  |   |
.       | |_          |     |   |_  |_  |_ _|     |     |_    |_|  _|
.       |   |_       _|     |     |_  |_ _        |       |_      |
.       |     |_    |       |       |_    |       |         |_    |
.       |       |_  |       |         |_  |       |           |_  |
.       |         |_|       |           |_|       |             |_|
.       |_ _ _ _ _ _ _ _    |_ _ _ _ _ _ _ _ _    |_ _ _ _ _ _ _ _ _ _
.                      x                     x                       x
.
n:              7                    8                      9
a(n):           1                    2                      1
AS(n):         20                   21                     32
.
For n = 9 the figures 1, 2 and 3 below show respectively the three stages described in the Comments section as follows:
.
.   y|_ _ _ _ _ 5            y|_ _ _ _ _ _ _ _ _      y|          _ _ _ _
.    |_ _ _ _ _|              |_ _ _ _ _|       |      |  _ _ _ _|       |
.    |         |_ _ 3         | |_      |_ _ R  |      | |_       _ _    |
.    |         |_  |          |   |_    |_  |   |      |   |_    |_  |   |
.    |           |_|_ _ 5     |     |_ T  |_|_ _|      |     |_    |_|  _|
.    |               | |      |       |_      | |      |       |_      |
.    |      Q        | |      |         |_    | |      |         |_    |
.    |               | |      |    W      |_  | |      |           |_  |
.    |               | |      |             |_| |      |             |_|
.    |_ _ _ _ _ _ _ _|_|_     |_ _ _ _ _ _ _ _|_|_     |_ _ _ _ _ _ _ _ _ _
.                       x                        x                        x
.         Figure 1.                Figure 2.                Figure 3.
.         Symmetric                Symmetric                Symmetric
.       representation           representation           representation
.         of sigma(9)              of sigma(9)            of antisigma(9)
.       A000203(9) = 13          A000203(9) = 13          A024816(9) = 32
.           and of                   and of
.     Q = A024916(8) = 56      R = A004125(9) = 12
.                              T = A244048(9) = 20
.                              T = A153485(8) = 20
.                              W = A000217(8) = 36
.
Note that the symmetric representation of antisigma(9) contains a hole formed by three cells because these three cells were the central part of the symmetric representation of sigma(9).
		

Crossrefs

Showing 1-5 of 5 results.