18738

Appears in sequences

• a(n) is the number of conjugacy classes in the alternating group A_n.at n=39A000702
• Numbers k such that 159*2^k + 1 is prime.at n=31A032456
• Number of (unordered) ways of making change for n cents using coins of 1/2, 1, 2, 3, 5, 10, 20, 25, 50, 100 cents (all historical U.S.A. coinage denominations up to 100 cents).at n=46A067997
• Number of i-triangulated perfect graphs on n nodes.at n=8A123427
• Numbers m such that A132575(m) = A132575(m-1).at n=10A132580
• Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a one by five or five by one block.at n=10A145971
• a(n) counts the distinct cubical (on alphabet of 3 symbols) billiard words with length n, acting as prefix to just k = 2 such words of length n+1 (that is, a subset of "special").at n=17A180438
• Number of nX3 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=3A221358
• Number of nX4 arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=2A221359
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=17A221361
• T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with no 2-loops and with no occupancy greater than 2.at n=18A221361
• Number of partitions p of n such that 1 + (1/2)*max(p) is a part of p.at n=46A238625
• a(1)=0; for n>1, a(n) = 4*n^3 - 3*n^2 - 3*n + 4.at n=16A296363
• G.f. A(x) satisfies: Sum_{n>=0} A(x)^((n+1)^2) * x^n = Sum_{n>=0} ((1+x)^(n+1) + 1)^n * x^n.at n=9A326557
• a(n) is the smallest nonnegative integer m such that the integer part of tan(m) is equal to n.at n=34A327788
• Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n.at n=50A362142
• Maximum number of ways in which a set of integer-sided squares can tile an n X 5 rectangle.at n=9A362146
• Number of cyclic edge cuts in the (2n-1)-triangular snake graph.at n=6A379741