61320

Appears in sequences

• Mixed partitions of n.at n=42A002096
• Number of primitive (aperiodic, or Lyndon) asymmetric rhythm cycles: ones having no nontrivial shift automorphism.at n=12A006575
• Number of primitive polynomials of degree n over GF(3).at n=12A027385
• Base 3 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,0.at n=10A033139
• Base 9 digits are, in order, the first n terms of the periodic sequence with initial period 1,0,3.at n=5A037595
• Numbers that can be expressed as the difference of the squares of primes in exactly six distinct ways.at n=34A092002
• Number of Lyndon words on {1, 2, 3} with an even number of 1's.at n=12A133267
• Records in A094593.at n=19A182109
• Number of (n+1)X(n+1) 0..3 arrays with the permanents of 2X2 subblocks nondecreasing rightwards and downwards.at n=1A205173
• Number of (n+1)X3 0..3 arrays with the permanents of 2X2 subblocks nondecreasing rightwards and downwards.at n=1A205175
• T(n,k) = Number of (n+1) X (k+1) 0..3 arrays with the permanents of 2X2 subblocks nondecreasing rightwards and downwards.at n=4A205181
• Number of n-bead necklaces of 4 colors allowing reversal, with no adjacent beads having the same color.at n=12A208540
• Numbers n such that {largest m such that 1, 2, ..., m divide n} is different from {largest m such that m! divides n^2}.at n=37A232099
• Expansion of (1+4*x+x^2)/((1+x)^2*(1-x)^5).at n=29A233329
• a(n) is the least integer k such that sigma(k)/(d(k)*sopf(k)) = n where d=A000005, sigma=A000203 and sopf=A008472.at n=36A328174
• Number of complete compositions of n whose multiplicities cover an initial interval of positive integers.at n=22A329748
• Number of n-colorings of the vertices of the 4-dimensional cross polytope such that no two adjacent vertices have the same color.at n=7A334281
• Primorial deflation of the n-th colossally abundant number: the unique integer k such that A108951(k) = A004490(n).at n=32A342012
• Triangle read by rows: T(n,k) is the number of n-colorings of the vertices of the k-dimensional cross polytope such that no two adjacent vertices have the same color. 0 <= k <= n.at n=32A342088
• Number of ways to form a direct sum decomposition of the vector space GF(2)^n and then choose a basis for each subspace in the decomposition.at n=4A373536