A005232 -id:A005232 - cp's OEIS frontend

A008805 Triangular numbers repeated.

1, 1, 3, 3, 6, 6, 10, 10, 15, 15, 21, 21, 28, 28, 36, 36, 45, 45, 55, 55, 66, 66, 78, 78, 91, 91, 105, 105, 120, 120, 136, 136, 153, 153, 171, 171, 190, 190, 210, 210, 231, 231, 253, 253, 276, 276, 300, 300, 325, 325, 351, 351, 378, 378, 406, 406, 435, 435

Offset: 0

N. J. A. Sloane

Number of choices for nonnegative integers x,y,z such that x and y are even and x + y + z = n.
Diagonal sums of A002260, when arranged as a number triangle. - Paul Barry, Feb 28 2003
a(n) = number of partitions of n+4 such that the differences between greatest and smallest parts are 2: a(n-4) = A097364(n,2) for n>3. - Reinhard Zumkeller, Aug 09 2004
For n >= i, i=4,5, a(n-i) is the number of incongruent two-color bracelets of n beads, i from them are black (cf. A005232, A032279), having a diameter of symmetry. - Vladimir Shevelev, May 03 2011
Prefixing A008805 by 0,0,0,0 gives the sequence c(0), c(1), ... defined by c(n)=number of (w,x,y) such that w = 2x+2y, where w,x,y are all in {1,...,n}; see A211422. - Clark Kimberling, Apr 15 2012
Partial sums of positive terms of A142150. - Reinhard Zumkeller, Jul 07 2012
The sum of the first parts of the nondecreasing partitions of n+2 into exactly two parts, n >= 0. - Wesley Ivan Hurt, Jun 08 2013
Number of the distinct symmetric pentagons in a regular n-gon, see illustration for some small n in links. - Kival Ngaokrajang, Jun 25 2013
a(n) is the number of nonnegative integer solutions to the equation x + y + z = n such that x + y <= z. For example, a(4) = 6 because we have 0+0+4 = 0+1+3 = 0+2+2 = 1+0+3 = 1+1+2 = 2+0+2. - Geoffrey Critzer, Jul 09 2013
a(n) is the number of distinct opening moves in n X n tic-tac-toe. - I. J. Kennedy, Sep 04 2013
a(n) is the number of symmetry-allowed, linearly-independent terms at n-th order in the series expansion of the T2 X t2 vibronic perturbation matrix, H(Q) (cf. Opalka & Domcke). - Bradley Klee, Jul 20 2015
a(n-1) also gives the number of D_4 (dihedral group of order 4) orbits of an n X n square grid with squares coming in either of two colors and only one square has one of the colors. - Wolfdieter Lang, Oct 03 2016
Also, this sequence is the third column in the triangle of the coefficients of the sum of two consecutive Fibonacci polynomials F(n+1, x) and F(n, x) (n>=0) in ascending powers of x. - Mohammad K. Azarian, Jul 18 2018
In an n-person symmetric matching pennies game (a zero-sum normal-form game) with n > 2 symmetric and indistinguishable players, each with two strategies (viz. heads or tails), a(n-3) is the number of distinct subsets of players that must play the same strategy to avoid incurring losses (single pure Nash equilibrium in the reduced game). The total number of distinct partitions is A000217(n-1). - Ambrosio Valencia-Romero, Apr 17 2022
a(n) is the number of connected bipartite graphs with n+1 edges and a stable set of cardinality 2. - Christian Barrientos, Jun 15 2022
a(n) is the number of 132-avoiding odd Grassmannian permutations of size n+2. - Juan B. Gil, Mar 10 2023
Consider a regular n-gon with all diagonals drawn. Define a "layer" to be the set of all regions sharing an edge with the exterior. Removing a layer creates another layer. Count the layers, removing them until none remain. The number of layers is a(n-2). See illustration. - Christopher Scussel, Nov 07 2023

			a(5) = 6, since (5) + 2 = 7 has three nondecreasing partitions with exactly 2 parts: (1,6),(2,5),(3,4). The sum of the first parts of these partitions = 1 + 2 + 3 = 6. - _Wesley Ivan Hurt_, Jun 08 2013

H. D. Brunk, An Introduction to Mathematical Statistics, Ginn, Boston, 1960; p. 360.

Vincenzo Librandi, Table of n, a(n) for n = 0..3000
G. E. Andrews, M. Beck, and N. Robbins, Partitions with fixed differences between largest and smallest parts, arXiv preprint arXiv:1406.3374 [math.NT], 2014.
P. Flajolet and R. Sedgewick, Analytic Combinatorics, 2009; see page 46.
Juan B. Gil and Jessica A. Tomasko, Pattern-avoiding even and odd Grassmannian permutations, arXiv:2207.12617 [math.CO], 2022.
Jia Huang, Partially Palindromic Compositions, J. Int. Seq. (2023) Vol. 26, Art. 23.4.1. See pp. 4, 19.
Kival Ngaokrajang, The distinct symmetric 5-gons in a regular n-gon for n = 6..13
D. Opalka and W. Domcke, High-order expansion of T2xt2 Jahn-Teller potential energy surfaces in tetrahedral molecules, J. Chem. Phys., 132, 154108 (2010).
Christopher Scussel, Illustration of layers in regular n-gons with all diagonals drawn
Vladimir Shevelev, A problem of enumeration of two-color bracelets with several variations, arXiv:0710.1370 [math.CO], 2007-2011.
Index entries for two-way infinite sequences
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).
Index entries for Molien series

Cf. A000217, A002260, A002620, A006918 (partial sums), A054252, A135276, A142150, A158920 (binomial trans.).

List([0..60], n-> (2*n +3 +(-1)^n)*(2*n +7 +(-1)^n)/32); # G. C. Greubel, Sep 12 2019

import Data.List (transpose)
a008805 = a000217 . (`div` 2) . (+ 1)
a008805_list = drop 2 $ concat $ transpose [a000217_list, a000217_list]
-- Reinhard Zumkeller, Feb 01 2013

[(2*n+3+(-1)^n)*(2*n+7+(-1)^n)/32 : n in [0..50]]; // Wesley Ivan Hurt, Apr 22 2015

A008805:=n->(2*n+3+(-1)^n)*(2*n+7+(-1)^n)/32: seq(A008805(n), n=0..50); # Wesley Ivan Hurt, Apr 22 2015

CoefficientList[Series[1/(1-x^2)^2/(1-x), {x, 0, 50}], x]
Table[Binomial[Floor[n/2] + 2, 2], {n, 0, 57}] (* Michael De Vlieger, Oct 03 2016 *)

PARI
```
a(n)=(n\2+2)*(n\2+1)/2
```

def A008805(n): return (m:=(n>>1)+1)*(m+1)>>1 # Chai Wah Wu, Oct 20 2023

[(2*n +3 +(-1)^n)*(2*n +7 +(-1)^n)/32 for n in (0..60)] # G. C. Greubel, Sep 12 2019

G.f.: 1/((1-x)*(1-x^2)^2) = 1/((1+x)^2*(1-x)^3).
E.g.f.: (exp(x)*(2*x^2 +12*x+ 11) - exp(-x)*(2*x -5))/16.
a(-n) = a(-5+n).
a(n) = binomial(floor(n/2)+2, 2). - Vladimir Shevelev, May 03 2011
From Paul Barry, May 31 2003: (Start)
a(n) = ((2*n +5)*(-1)^n + (2*n^2 +10*n +11))/16.
a(n) = Sum_{k=0..n} ((k+2)*(1+(-1)^k))/4. (End)
From Paul Barry, Apr 16 2005: (Start)
a(n) = Sum_{k=0..n} floor((k+2)/2)*(1-(-1)^(n+k-1))/2.
a(n) = Sum_{k=0..floor(n/2)} floor((n-2k+2)/2). (End)
A signed version is given by Sum_{k=0..n} (-1)^k*floor(k^2/4). - Paul Barry, Aug 19 2003
a(n) = A108299(n-2,n)*(-1)^floor((n+1)/2) for n>1. - Reinhard Zumkeller, Jun 01 2005
a(n) = A004125(n+3) - A049798(n+2). - Carl Najafi, Jan 31 2013
a(n) = Sum_{i=1..floor((n+2)/2)} i. - Wesley Ivan Hurt, Jun 08 2013
a(n) = (1/2)*floor((n+2)/2)*(floor((n+2)/2)+1). - Wesley Ivan Hurt, Jun 08 2013
From Wesley Ivan Hurt, Apr 22 2015: (Start)
a(n) = a(n-1) +2*a(n-2) -2*a(n-3) -a(n-4) +a(n-5).
a(n) = (2*n +3 +(-1)^n)*(2*n +7 +(-1)^n)/32. (End)
a(n-1) = A054252(n,1) = A054252(n^2-1), n >= 1. See a Oct 03 2016 comment above. - Wolfdieter Lang, Oct 03 2016
a(n) = A000217(A008619(n)). - Guenther Schrack, Sep 12 2018
From Ambrosio Valencia-Romero, Apr 17 2022: (Start)
a(n) = a(n-1) if n odd, a(n) = a(n-1) + (n+2)/2 if n is even, for n > 0, a(0) = 1.
a(n) = (n+1)*(n+3)/8 if n odd, a(n) = (n+2)*(n+4)/8 if n is even, for n >= 0.
a(n) = A002620(n+2) - a(n-1), for n > 0, a(0) = 1.
a(n) = A142150(n+2) + a(n-1), for n > 0, a(0) = 1.
a(n) = A000217(n+3)/2 - A135276(n+3)/2. (End)

A052307 Triangle read by rows: T(n,k) = number of bracelets (reversible necklaces) with n beads, k of which are black and n - k are white.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 3, 3, 3, 1, 1, 1, 1, 3, 4, 4, 3, 1, 1, 1, 1, 4, 5, 8, 5, 4, 1, 1, 1, 1, 4, 7, 10, 10, 7, 4, 1, 1, 1, 1, 5, 8, 16, 16, 16, 8, 5, 1, 1, 1, 1, 5, 10, 20, 26, 26, 20, 10, 5, 1, 1, 1, 1, 6, 12, 29, 38, 50, 38, 29, 12, 6, 1, 1, 1, 1, 6, 14, 35, 57, 76, 76, 57, 35, 14, 6, 1, 1

Offset: 0

Christian G. Bower, Nov 15 1999

Equivalently, T(n,k) is the number of orbits of k-element subsets of the vertices of a regular n-gon under the usual action of the dihedral group D_n, or under the action of Euclidean plane isometries. Note that each row of the table is symmetric and unimodal. - Austin Shapiro, Apr 20 2009

Also, the number of k-chords in n-tone equal temperament, up to (musical) transposition and inversion. Example: there are 29 tetrachords, 38 pentachords, 50 hexachords in the familiar 12-tone equal temperament. Called "Forte set-classes," after Allen Forte who first cataloged them. - Jon Wild, May 21 2004

			Triangle T(n,k) (with rows n >= 0 and columns k = 0..n) begins:
   1;
   1,  1;
   1,  1,  1;
   1,  1,  1,  1;
   1,  1,  2,  1,  1;
   1,  1,  2,  2,  1,  1;
   1,  1,  3,  3,  3,  1,  1;
   1,  1,  3,  4,  4,  3,  1,  1;
   1,  1,  4,  5,  8,  5,  4,  1,  1;
   1,  1,  4,  7, 10, 10,  7,  4,  1,  1;
   1,  1,  5,  8, 16, 16, 16,  8,  5,  1,  1;
   1,  1,  5, 10, 20, 26, 26, 20, 10,  5,  1,  1;
   1,  1,  6, 12, 29, 38, 50, 38, 29, 12,  6,  1,  1;
   ...

Martin Gardner, "New Mathematical Diversions from Scientific American" (Simon and Schuster, New York, 1966), pages 245-246.
N. Zagaglia Salvi, Ordered partitions and colourings of cycles and necklaces, Bull. Inst. Combin. Appl., 27 (1999), 37-40.

Washington Bomfim, Rows n = 0..130, flattened
N. J. Fine, Classes of periodic sequences, Illinois J. Math., 2 (1958), 285-302.
E. N. Gilbert and J. Riordan, Symmetry types of periodic sequences, Illinois J. Math., 5 (1961), 657-665.
G. Gori, S. Paganelli, A. Sharma, P. Sodano, and A. Trombettoni, Bell-Paired States Inducing Volume Law for Entanglement Entropy in Fermionic Lattices, arXiv:1405.3616 [cond-mat.stat-mech], 2014. See Section V.
H. Gupta, Enumeration of incongruent cyclic k-gons, Indian J. Pure and Appl. Math., 10(8) (1979), 964-999.
S. Karim, J. Sawada, Z. Alamgirz, and S. M. Husnine, Generating bracelets with fixed content, Theoretical Computer Science, 475 (2013), 103-112.
John P. McSorley and Alan H. Schoen, Rhombic tilings of (n, k)-ovals, (n, k, lambda)-cyclic difference sets, and related topics, Discrete Math., 313 (2013), 129-154. - From _N. J. A. Sloane_, Nov 26 2012
A. L. Patterson, Ambiguities in the X-Ray Analysis of Crystal Structures, Phys. Rev. 65 (1944), 195 - 201 (see Table I). [From _N. J. A. Sloane_, Mar 14 2009]
Richard H. Reis, A formula for C(T) in Gupta's paper, Indian J. Pure and Appl. Math., 10(8) (1979), 1000-1001.
Vladimir Shevelev, Necklaces and convex k-gons, Indian J. Pure and Appl. Math., 35(5) (2004), 629-638.
Vladimir Shevelev, Necklaces and convex k-gons, Indian J. Pure and Appl. Math., 35(5) (2004), 629-638.
Index entries for sequences related to bracelets

Row sums: A000029. Columns 0-12: A000012, A000012, A008619, A001399, A005232, A032279, A005513, A032280, A005514, A032281, A005515, A032282, A005516.

Cf. A047996, A051168, A052308, A052309, A052310.

A052307 := proc(n,k)
        local hk,a,d;
        if k = 0 then
                return 1 ;
        end if;
        hk := k mod 2 ;
        a := 0 ;
        for d in numtheory[divisors](igcd(k,n)) do
                a := a+ numtheory[phi](d)*binomial(n/d-1,k/d-1) ;
        end do:
        %/k + binomial(floor((n-hk)/2),floor(k/2)) ;
        %/2 ;
end proc: # R. J. Mathar, Sep 04 2011

Table[If[m*n===0,1,1/2*If[EvenQ[n], If[EvenQ[m], Binomial[n/2, m/2], Binomial[(n-2)/2, (m-1)/2 ]], If[EvenQ[m], Binomial[(n-1)/2, m/2], Binomial[(n-1)/2, (m-1)/2]]] + 1/2*Fold[ #1 +(EulerPhi[ #2]*Binomial[n/#2, m/#2])/n &, 0, Intersection[Divisors[n], Divisors[m]]]], {n,0,12}, {m,0,n}] (* Wouter Meeussen, Aug 05 2002, Jan 19 2009 *)

B(n,k)={ if(n==0, return(1)); GCD = gcd(n, k); S = 0;
for(d = 1, GCD, if((k%d==0)&&(n%d==0), S+=eulerphi(d)*binomial(n/d,k/d)));
return (binomial(floor(n/2)- k%2*(1-n%2), floor(k/2))/2 + S/(2*n)); }
n=0;k=0; for(L=0, 8645, print(L, " ", B(n,k)); k++; if(k>n, k=0; n++))
/* Washington Bomfim, Jun 30 2012 */

from sympy import binomial as C, totient, divisors, gcd
def T(n, k): return 1 if n==0 else C((n//2) - k%2 * (1 - n%2), (k//2))/2 + sum(totient(d)*C(n//d, k//d) for d in divisors(gcd(n, k)))/(2*n)
for n in range(11): print([T(n, k) for k in range(n + 1)]) # Indranil Ghosh, Apr 23 2017

T(0,0) = 1. If n > 0, T(n,k) = binomial(floor(n/2) - (k mod 2) * (1 - (n mod 2)), floor(k/2)) / 2 + Sum_{d|n, d|k} (phi(d)*binomial(n/d, k/d)) / (2*n). - Washington Bomfim, Jun 30 2012 [edited by Petros Hadjicostas, May 29 2019]
From Freddy Barrera, Apr 21 2019: (Start)
T(n,k) = (1/2) * (A119963(n,k) + A047996(n,k)).
T(n,k) = T(n, n-k) for each k < n (Theorem 2 of H. Gupta). (End)
G.f. for column k >= 1: (x^k/2) * ((1/k) * Sum_{m|k} phi(m)/(1 - x^m)^(k/m) + (1 + x)/(1 - x^2)^floor((k/2) + 1)). (This formula is due to Herbert Kociemba.) - Petros Hadjicostas, May 25 2019
Bivariate o.g.f.: Sum_{n,k >= 0} T(n, k)*x^n*y^k = (1/2) * ((x + 1) * (x*y + 1) / (1 - x^2 * (y^2 + 1)) + 1 - Sum_{d >= 1} (phi(d)/d) * log(1 - x^d * (1 + y^d))). - Petros Hadjicostas, Jun 13 2019

A008804 Expansion of 1/((1-x)^2(1-x^2)(1-x^4)).

Original entry on oeis.org

1, 2, 4, 6, 10, 14, 20, 26, 35, 44, 56, 68, 84, 100, 120, 140, 165, 190, 220, 250, 286, 322, 364, 406, 455, 504, 560, 616, 680, 744, 816, 888, 969, 1050, 1140, 1230, 1330, 1430, 1540, 1650, 1771, 1892, 2024, 2156, 2300, 2444, 2600, 2756, 2925, 3094, 3276, 3458

Offset: 0

N. J. A. Sloane

b(n)=a(n-3) is the number of asymmetric nonnegative integer 2 X 2 matrices with sum of elements equal to n, under action of dihedral group D_4(b(0)=b(1)=b(2)=0). G.f. for b(n) is x^3/((1-x)^2*(1-x^2)*(1-x^4)). - Vladeta Jovovic, May 07 2000
If the offset is changed to 5, this is the 2nd Witt transform of A004526 [Moree]. - R. J. Mathar, Nov 08 2008
a(n) is the number of partitions of 2*n into powers of 2 less than or equal to 2^3. First differs from A000123 at n=8. - Alois P. Heinz, Apr 02 2012
a(n) is the number of bracelets with 4 black beads and n+3 white beads which have no reflection symmetry. For n=1 we have for example 2 such bracelets with 4 black beads and 4 white beads: BBBWBWWW and BBWBWBWW. - Herbert Kociemba, Nov 27 2016
a(n) is the also number of aperiodic bracelets with 4 black beads and n+3 white beads which have no reflection symmetry. This is equivalent to saying that a(n) is the (n+7)th element of the DHK[4] (bracelet, identity, unlabeled, 4 parts) transform of 1, 1, 1, ... (see Bower's link about transforms). Thus, for n >= 1 , a(n) = (DHK[4] c){n+7}, where c = (1 : n >= 1). This is because every bracelet with 4 black beads and n+3 white beads which has no reflection symmetry must also be aperiodic. This statement is not true anymore if we have k black beads where k is even >= 6. - _Petros Hadjicostas, Feb 24 2019

			G.f. = 1 + 2*x + 4*x^2 + 6*x^3 + 10*x^4 + 14*x^5 + 20*x^6 + 26*x^7 + 35*x^8 + ...
There are 10 asymmetric nonnegative integer 2 X 2 matrices with sum of elements equal to 7 under action of D_4:
[0 0] [0 0] [0 0] [0 1] [0 1] [0 1] [0 1] [0 2] [0 2] [1 1]
[1 6] [2 5] [3 4] [2 4] [3 3] [4 2] [5 1] [3 2] [4 1] [2 3]

T. D. Noe, Table of n, a(n) for n = 0..1000
C. G. Bower, Transforms (2)
Petros Hadjicostas, The aperiodic version of Herbert Kociemba's formula for bracelets with no reflection symmetry, 2019.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 197
Pieter Moree, The formal series Witt transform, Discr. Math. no. 295 vol. 1-3 (2005) 143-160. [From _R. J. Mathar_, Nov 08 2008]
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,2,-2,0,2,-1).

Cf. A000123, A001400, A002620, A004526, A005232, A014557, A032246, A032248, A053307.

Column k=3 of A181322. Column k = 4 of A180472 (but with different offset).

a:=[1,2,4,6,10,14,20,26];; for n in [9..60] do a[n]:=2*a[n-1] -2*a[n-3]+2*a[n-4]-2*a[n-5]+2*a[n-7]-a[n-8]; od; a; # G. C. Greubel, Sep 12 2019

R:=PowerSeriesRing(Integers(), 60); Coefficients(R!( 1/((1-x)^2*(1-x^2)*(1-x^4)) )); // G. C. Greubel, Sep 12 2019

seq(coeff(series(1/((1-x)^2*(1-x^2)*(1-x^4)), x, n+1), x, n), n = 0..60); # G. C. Greubel, Sep 12 2019

LinearRecurrence[{2,0,-2,2,-2,0,2,-1}, {1,2,4,6,10,14,20,26}, 60] (* Vladimir Joseph Stephan Orlovsky, Feb 23 2012 *)
gf[x_,k_]:=x^k/2 (1/k Plus@@(EulerPhi[#] (1-x^#)^(-(k/#))&/@Divisors[k])-(1+x)/(1-x^2)^Floor[k/2+1]); CoefficientList[Series[gf[x,4]/x^7,{x,0,60}],x] (* Herbert Kociemba, Nov 27 2016 *)
Table[(84 +12*(-1)^n +85*n +3*(-1)^n*n +24*n^2 +2*n^3 +12*Sin[n Pi/2])/96, {n,0,60}] (* Eric W. Weisstein, Oct 12 2017 *)
CoefficientList[Series[1/((1-x)^4*(1+x)^2*(1+x^2)), {x,0,60}], x] (* Eric W. Weisstein, Oct 12 2017 *)

a(n)=(84+12*(-1)^n+6*I*((-I)^n-I^n)+(85+3*(-1)^n)*n+24*n^2 +2*n^3)/96 \\ Jaume Oliver Lafont, Sep 20 2009

{a(n) = my(s = 1); if( n<-7, n = -8 - n; s = -1); if( n<0, 0, s * polcoeff( 1 / ((1 - x)^2 * (1 - x^2) * (1 - x^4)) + x * O(x^n), n))}; /* Michael Somos, Feb 02 2011 */

def A008804_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P(1/((1-x)^2*(1-x^2)*(1-x^4))).list()
A008804_list(60) # G. C. Greubel, Sep 12 2019

For a formula for a(n) see A014557.
a(n) = (84 +85*n +24*n^2 +2*n^3 +12*A056594(n+3) +3*(-1)^n*(n+4))/96. - R. J. Mathar, Nov 08 2008
a(n) = 2*(Sum_{k=0..floor(n/2)} A002620(k+2)) - A002620(n/2+2)*(1+(-1)^n)/2. - Paul Barry, Mar 05 2009
G.f.: 1/((1-x)^4*(1+x)^2*(1+x^2)). - Jaume Oliver Lafont, Sep 20 2009
Euler transform of length 4 sequence [2, 1, 0, 1]. - Michael Somos, Feb 05 2011
a(n) = -a(-8 - n) for all n in Z. - Michael Somos, Feb 05 2011
From Herbert Kociemba, Nov 27 2016: (Start)
More generally gf(k) is the g.f. for the number of bracelets without reflection symmetry with k black beads and n-k white beads.
gf(k): x^k/2 * ( (1/k)*Sum_{n|k} phi(n)/(1 - x^n)^(k/n) - (1 + x)/(1 -x^2)^floor(k/2 + 1) ). The g.f. here is gf(4)/x^7 because of the different offset. (End)
E.g.f.: ((48 + 54*x + 15*x^2 + x^3)*cosh(x) + 6*sin(x) + (36 + 57*x + 15*x^2 + x^3)*sinh(x))/48. - Stefano Spezia, May 15 2023
a(n) = A001400(n) + A001400(n-1) + A001400(n-2). - David García Herrero, Aug 26 2024
a(n) = floor((2*n^3 + 24*n^2 + n*(85+3*(-1)^n) + 96) / 96). - Hoang Xuan Thanh, May 24 2025

A008610 Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).

Original entry on oeis.org

1, 1, 3, 5, 10, 14, 22, 30, 43, 55, 73, 91, 116, 140, 172, 204, 245, 285, 335, 385, 446, 506, 578, 650, 735, 819, 917, 1015, 1128, 1240, 1368, 1496, 1641, 1785, 1947, 2109, 2290, 2470, 2670, 2870, 3091, 3311, 3553, 3795, 4060, 4324, 4612, 4900, 5213, 5525, 5863

Offset: 0

N. J. A. Sloane

a(n) is the number of necklaces with 4 black beads and n white beads.
Also nonnegative integer 2 X 2 matrices with sum of elements equal to n, up to rotational symmetry.
The g.f. is Z(C_4,x), the 4-variate cycle index polynomial for the cyclic group C_4, with substitution x[i]->1/(1-x^i), i=1,...,4. Therefore by Polya enumeration a(n) is the number of cyclically inequivalent 4-necklaces whose 4 beads are labeled with nonnegative integers such that the sum of labels is n, for n=0,1,2,... See A102190 for Z(C_4,x). - Wolfdieter Lang, Feb 15 2005

			There are 10 inequivalent nonnegative integer 2 X 2 matrices with sum of elements equal to 4, up to rotational symmetry:
[0 0] [0 0] [0 0] [0 0] [0 1] [0 1] [0 1] [0 2] [0 2] [1 1]
[0 4] [1 3] [2 2] [3 1] [1 2] [2 1] [3 0] [1 1] [2 0] [1 1].

D. J. Benson, Polynomial Invariants of Finite Groups, Cambridge, 1993, p. 104.
E. V. McLaughlin, Numbers of factorizations in non-unique factorial domains, Senior Thesis, Allegeny College, Meadville, PA, April 2004.

G. C. Greubel, Table of n, a(n) for n = 0..1000
David Broadhurst and Xavier Roulleau, Number of partitions of modular integers, arXiv:2502.19523 [math.NT], 2025. See p. 19.
Mónica A. Reyes, Cristina Dalfó, Miguel Àngel Fiol, and Arnau Messegué, A general method to find the spectrum and eigenspaces of the k-token of a cycle, and 2-token through continuous fractions, arXiv:2403.20148 [math.CO], 2024. See p. 6.
Index entries for sequences related to groups
Index entries for Molien series
Index entries for sequences related to necklaces
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,2,-2,0,2,-1).

Row n=2 of A343874.
Column k=4 of A037306 and A047996.
Cf. A000031, A005232, A008804, A047996, A032801.

a:=[1,1,3,5,10,14,22,30];; for n in [9..50] do a[n]:=2*a[n-1]-2*a[n-3] +2*a[n-4]-2*a[n-5]+2*a[n-7]-a[n-1]; od; a; # G. C. Greubel, Jan 31 2020

R:=PowerSeriesRing(Integers(), 50); Coefficients(R!( (1+2*x^3+x^4)/((1-x)*(1-x^2)^2*(1-x^4)) )); // G. C. Greubel, Jan 31 2020

1/(1-x)/(1-x^2)^2/(1-x^4)*(1+2*x^3+x^4);
seq(coeff(series(%, x, n+1), x, n), n=0..40);

k = 4; Table[Apply[Plus, Map[EulerPhi[ # ]Binomial[n/#, k/# ] &, Divisors[GCD[n, k]]]]/n, {n, k, 30}] (* Robert A. Russell, Sep 27 2004 *)
LinearRecurrence[{2,0,-2,2,-2,0,2,-1}, {1,1,3,5,10,14,22,30}, 50] (* G. C. Greubel, Jan 31 2020 *)

a(n)=if(n,([0,1,0,0,0,0,0,0; 0,0,1,0,0,0,0,0; 0,0,0,1,0,0,0,0; 0,0,0,0,1,0,0,0; 0,0,0,0,0,1,0,0; 0,0,0,0,0,0,1,0; 0,0,0,0,0,0,0,1; -1,2,0,-2,2,-2,0,2]^n*[1;1;3;5;10;14;22;30])[1,1],1) \\ Charles R Greathouse IV, Oct 22 2015

my(x='x+O('x^50)); Vec((1+2*x^3+x^4)/((1-x)*(1-x^2)^2*(1-x^4))) \\ G. C. Greubel, Jan 31 2020

def A008610_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P( (1+2*x^3+x^4)/((1-x)*(1-x^2)^2*(1-x^4)) ).list()
A008610_list(50) # G. C. Greubel, Jan 31 2020

G.f.: (1+2*x^3+x^4)/((1-x)*(1-x^2)^2*(1-x^4)) = (1-x+x^2+x^3)/((1-x)^2*(1-x^2)*(1-x^4)).
a(n) = (1/48)*(2*n^3 + 3*(-1)^n*(n + 4) + 12*n^2 + 25*n + 24 + 12*cos(n*Pi/2)). - Ralf Stephan, Apr 29 2014
G.f.: (1/4)*(1/(1-x)^4 + 1/(1-x^2)^2 + 2/(1-x^4)). - Herbert Kociemba, Oct 22 2016
a(n) = -A032801(-n), per formulae of Colin Barker (A032801) and R. Stephan (above). Also, a(n) - A032801(n+4) = (1+(-1)^signum(n mod 4))/2, i.e., (1,0,0,0,1,0,0,0,...) repeating, (offset 0). - Gregory Gerard Wojnar, Jul 09 2022

Comment and example from Vladeta Jovovic, May 18 2000

A006381 Number of n X 3 binary matrices under row and column permutations and column complementations.

Original entry on oeis.org

1, 1, 4, 7, 19, 32, 68, 114, 210, 336, 562, 862, 1349, 1987, 2950, 4201, 5991, 8278, 11422, 15386, 20660, 27218, 35718, 46158, 59401, 75475, 95494, 119545, 149035, 184118, 226562, 276620, 336470, 406490, 489344, 585572, 698397, 828549, 979896

Offset: 0

N. J. A. Sloane

Also the number of ways in which to label the vertices of the cube (or faces of the octahedron) with nonnegative integers summing to n, where labelings that differ only by rotation or reflection are considered the same. - Isabel C. Lugo (izzycat(AT)gmail.com), Aug 26 2004

			Representatives of the seven classes of 3 X 3 binary matrices are:
[ 1 1 1 ] [ 1 1 0 ] [ 1 0 1 ] [ 1 0 1 ] [ 0 1 1 ] [ 0 1 1 ] [ 0 1 1 ]
[ 1 1 1 ] [ 1 1 1 ] [ 1 1 0 ] [ 1 1 0 ] [ 1 0 1 ] [ 1 0 0 ] [ 1 0 0 ]
[ 1 1 1 ] [ 1 1 1 ] [ 1 1 1 ] [ 1 1 0 ] [ 1 1 0 ] [ 1 1 1 ] [ 1 0 0 ].

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 0..1000
M. A. Harrison, On the number of classes of binary matrices, IEEE Trans. Computers, 22 (1973), 1048-1052.
Index entries for linear recurrences with constant coefficients, signature (3,-2,-1,2,-5,7,-4,2,2,-8,10,-8,2,2,-4,7,-5,2,-1,-2,3,-1).
Index entries for sequences related to binary matrices
Index entries for two-way infinite sequences

Column k=3 of A363349.

Cf. A000601, A005232, A006382, A006380, A002727, A006148.

Vec((1/(1 - x^1)^8 + 13/(1 - x^2)^4 + 6/(1 - x^1)^4/(1 - x^2)^2 + 12/(1 - x^4)^2 + 8/(1 - x^1)^2/(1 - x^3)^2 + 8/(1 - x^2)^1/(1 - x^6)^1)/48 + O(x^41)) \\ Andrew Howroyd, May 30 2023

G.f.: (1/(1 - x^1)^8 + 13/(1 - x^2)^4 + 6/(1 - x^1)^4/(1 - x^2)^2 + 12/(1 - x^4)^2 + 8/(1 - x^1)^2/(1 - x^3)^2 + 8/(1 - x^2)^1/(1 - x^6)^1)/48.

G.f.: (x^14 - 2*x^13 + 3*x^12 - 2*x^11 + 5*x^10 - 4*x^9 + 7*x^8 - 4*x^7 + 7*x^6 - 4*x^5 + 5*x^4 - 2*x^3 + 3*x^2 - 2*x + 1)/(x^6 - 1)/(x^2 + 1)^2/(x^2 + x + 1)/(x + 1)^3/(x - 1)^7.

Entry revised by Vladeta Jovovic, Aug 05 2000

Definition corrected by Max Alekseyev, Feb 05 2010

A006382 Number of n X 4 binary matrices under row and column permutations and column complementations.

Original entry on oeis.org

1, 1, 5, 11, 41, 101, 301, 757, 1981, 4714, 11133, 24763, 53818, 111941, 226857, 444260, 848620, 1576226, 2862426, 5077454, 8827758, 15043096, 25183794, 41434222, 67108437, 107051463, 168402958, 261384026, 400684767, 606936536

Offset: 0

N. J. A. Sloane

nonn

			Representatives of the five classes of 2 X 4 binary matrices are:
[ 1 1 1 1 ] [ 1 1 1 0 ] [ 1 1 0 1 ] [ 1 0 1 1 ] [ 0 1 1 1 ]
[ 1 1 1 1 ] [ 1 1 1 1 ] [ 1 1 1 0 ] [ 1 1 0 0 ] [ 1 0 0 0 ]

M. A. Harrison, On the number of classes of binary matrices, IEEE Trans. Computers, 22 (1973), 1048-1051.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (6, -13, 10, 4, -14, 25, -46, 53, -36, 8, 44, -111, 138, -123, 106, -54, -66, 181, -238, 259, -220, 98, 36, -150, 280, -352, 280, -150, 36, 98, -220, 259, -238, 181, -66, -54, 106, -123, 138, -111, 44, 8, -36, 53, -46, 25, -14, 4, 10, -13, 6, -1).
Index entries for sequences related to binary matrices
Index entries for two-way infinite sequences

Column k=4 of A363349.

Cf. A005232, A006380, A006381, A002727, A006148.

G.f. : (1/(1 - x^1)^16 + 51/(1 - x^2)^8 + 12/(1 - x^1)^8/(1 - x^2)^4 + 84/(1 - x^4)^4 + 12/(1 - x^1 )^4/(1 - x^2)^6 + 32/(1 - x^1)^4/(1 - x^3)^4 + 96/(1 - x^2)^2/(1 - x^6)^2 + 48/(1 - x^1)^2/(1 - x^2)^1/(1 - x^4)^3 + 48/(1 - x^8)^2)/384.

Entry revised by Vladeta Jovovic, Aug 05 2000

A363349 Array read by antidiagonals: T(n,k) is the number of equivalence classes of n X k binary matrices under permutation of rows and columns and complementation of columns.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 4, 4, 3, 1, 1, 1, 5, 7, 8, 3, 1, 1, 1, 6, 11, 19, 10, 4, 1, 1, 1, 7, 16, 41, 32, 16, 4, 1, 1, 1, 8, 23, 81, 101, 68, 20, 5, 1, 1, 1, 9, 31, 153, 299, 301, 114, 29, 5, 1, 1, 1, 10, 41, 273, 849, 1358, 757, 210, 35, 6, 1

Offset: 0

Andrew Howroyd, May 28 2023

T(n,k) is also the number of equivalence classes of n X k binary matrices with an even number of 1's in each column under permutation of rows and columns.

			Array begins:
======================================================
n/k| 0 1  2   3    4     5      6       7        8 ...
---+--------------------------------------------------
0  | 1 1  1   1    1     1      1       1        1 ...
1  | 1 1  1   1    1     1      1       1        1 ...
2  | 1 2  3   4    5     6      7       8        9 ...
3  | 1 2  4   7   11    16     23      31       41 ...
4  | 1 3  8  19   41    81    153     273      468 ...
5  | 1 3 10  32  101   299    849    2290     5901 ...
6  | 1 4 16  68  301  1358   6128   27008   114763 ...
7  | 1 4 20 114  757  5567  43534  343656  2645494 ...
8  | 1 5 29 210 1981 23350 319119 4633380 67013431 ...
  ...

Andrew Howroyd, Table of n, a(n) for n = 0..1325
M. A. Harrison, On the number of classes of binary matrices, IEEE Trans. Computers, 22 (1973), 1048-1051.
M. A. Harrison, On the number of classes of binary matrices, IEEE Transactions on Computers, C-22.12 (1973), 1048-1052. (Annotated scanned copy)

A259344 is the same array without the first row and column read by upward antidiagonals.
Columns k=0..6 are A000012, A004526(n+2), A005232, A006381, A006382, A056204, A056205.
Rows n=2..4 are A000027(n+1), A000601, A006380.
Main diagonal is A006383.
Cf. A028657, A241956, A362905.

\\ Compare A028657.
permcount(v) = {my(m=1, s=0, k=0, t); for(i=1, #v, t=v[i]; k=if(i>1&&t==v[i-1], k+1, 1); m*=t*k; s+=t); s!/m}
K(q, t)={sum(j=1, #q, gcd(t, q[j]))}
T(n, k)={if(n==0, 1, my(s=0); forpart(q=n, my(e=1<

A006383 Number of equivalence classes of n X n binary matrices when one can permute rows, permute columns and complement columns.

Original entry on oeis.org

1, 1, 3, 7, 41, 299, 6128, 343656, 67013431, 45770163273, 108577103160005, 886929528971819040, 24943191706060101926577, 2425246700258693990625775794, 820270898724825121532156178527106

Offset: 0

N. J. A. Sloane

			a(2) = 3:
00 10 11
00 00 00

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Andrew Howroyd, Table of n, a(n) for n = 0..50 (terms 0..35 from Sean A. Irvine)
M. A. Harrison, On the number of classes of binary matrices, IEEE Trans. Computers, 22 (1973), 1048-1051.
M. A. Harrison, On the number of classes of binary matrices, IEEE Transactions on Computers, C-22.12 (1973), 1048-1052. (Annotated scanned copy)
Index entries for sequences related to binary matrices

Main diagonal of A363349.

Cf. A002724, A005232, A006381, A006382, A056204, A056205.

Definition corrected by Brendan McKay, Jan 07 2007

Terms a(7) onward from Max Alekseyev, Feb 05 2010

A343875 Array read by antidiagonals: T(n,k) is the number of n X n nonnegative integer matrices with sum of elements equal to k, up to rotations and reflections.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 3, 3, 1, 0, 1, 4, 11, 3, 1, 0, 1, 8, 31, 24, 6, 1, 0, 1, 10, 84, 113, 55, 6, 1, 0, 1, 16, 198, 528, 410, 99, 10, 1, 0, 1, 20, 440, 2003, 2710, 1091, 181, 10, 1, 0, 1, 29, 904, 6968, 15233, 10488, 2722, 288, 15, 1, 0, 1, 35, 1766, 21593, 75258, 82704, 34399, 5806, 461, 15, 1

Offset: 0

Andrew Howroyd, May 06 2021

			Array begins:
=====================================================
n\k | 0  1   2    3     4      5       6        7
----+------------------------------------------------
  0 | 1  0   0    0     0      0       0        0 ...
  1 | 1  1   1    1     1      1       1        1 ...
  2 | 1  1   3    4     8     10      16       20 ...
  3 | 1  3  11   31    84    198     440      904 ...
  4 | 1  3  24  113   528   2003    6968    21593 ...
  5 | 1  6  55  410  2710  15233   75258   331063 ...
  6 | 1  6  99 1091 10488  82704  563864  3376134 ...
  7 | 1 10 181 2722 34399 360676 3235551 25387944 ...
  ...

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

Rows n=0..3 are A000007, A000012, A005232, A054343.
Columns 0..1 are A000012, A008805(n-1).
Cf. A054252 (binary case), A318795, A343097, A343874.

U(n,s) = {(s(1)^(n^2) + s(1)^(n%2)*(2*s(4)^(n^2\4) + s(2)^(n^2\2)) + 2*s(1)^n*s(2)^(n*(n-1)/2) + 2*(s(1)^(n%2)*s(2)^(n\2))^n )/8}
T(n,k)={polcoef(U(n,i->1/(1-x^i) + O(x*x^k)), k)}

A054343 Number of nonnegative integer 3 X 3 matrices with sum of elements equal to n, under action of dihedral group of the square D_4.

Original entry on oeis.org

1, 3, 11, 31, 84, 198, 440, 904, 1766, 3266, 5802, 9906, 16384, 26284, 41104, 62752, 93831, 137589, 198309, 281249, 393148, 542154, 738480, 994320, 1324668, 1747220, 2283396, 2958228, 3801600, 4848120, 6138624, 7720032, 9647133, 11982423, 14798223, 18176499

Offset: 0

Vladeta Jovovic, May 05 2000

			There are 11 nonisomorphic nonnegative integer 3 X 3 matrices with sum of elements equal to 2, under action of D_4:
[0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 0] [0 0 1] [0 0 0] [0 0 0] [0 0 0]
[0 0 0] [0 0 0] [0 0 1] [0 0 1] [0 1 0] [0 1 0] [1 0 1] [0 0 0] [0 0 0] [0 0 0] [0 2 0]
[0 1 1] [1 0 1] [0 1 0] [1 0 0] [0 0 1] [0 1 0] [0 0 0] [1 0 0] [0 0 2] [0 2 0] [0 0 0].

Colin Barker, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (5,-8,0,16,-24,16,8,-34,34,-8,-16,24,-16,0,8,-5,1).

Row n=3 of A343875.

Cf. A005232, A052365.

Vec((2*x^6+2*x^5+x^4+4*x^2-2*x+1)/((1-x^4)^2*(1-x^2)^2*(1-x)^5) + O(x^40)) \\ Colin Barker, Apr 26 2019

G.f.: (2*x^6+2*x^5+x^4+4*x^2-2*x+1)/((1-x^4)^2*(1-x^2)^2*(1-x)^5).

a(n) = 5*a(n-1) - 8*a(n-2) + 16*a(n-4) - 24*a(n-5) + 16*a(n-6) + 8*a(n-7) - 34*a(n-8) + 34*a(n-9) - 8*a(n-10) - 16*a(n-11) + 24*a(n-12) - 16*a(n-13) + 8*a(n-15) - 5*a(n-16) + a(n-17) for n>16. - Colin Barker, Apr 26 2019

cp's OEIS Frontend

A008805 Triangular numbers repeated.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

A052307 Triangle read by rows: T(n,k) = number of bracelets (reversible necklaces) with n beads, k of which are black and n - k are white.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A008804 Expansion of 1/((1-x)^2*(1-x^2)*(1-x^4)).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

A008610 Molien series of 4-dimensional representation of cyclic group of order 4 over GF(2) (not Cohen-Macaulay).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

Extensions

A006381 Number of n X 3 binary matrices under row and column permutations and column complementations.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A008804 Expansion of 1/((1-x)^2(1-x^2)(1-x^4)).