52488

Appears in sequences

• Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n.at n=20A000031
• a(n) = 8*3^n.at n=8A005051
• Number of vertex-transitive graphs with n nodes.at n=40A006799
• a(n) = floor(n/5)*floor((n+1)/5)*floor((n+2)/5)*floor((n+3)/5)*floor((n+4)/5).at n=44A008382
• Numbers of form 3^i*6^j, with i, j >= 0.at n=38A025614
• Numbers of form 3^i*8^j, with i, j >= 0.at n=34A025615
• Numbers of form 8^i*9^j, with i, j >= 0.at n=19A025633
• a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2,3; |s(i) - s(i-1)| <= 1 for i >= 4. Also a(n) = sum of numbers in row n+1 of the array T defined in A026082 and a(n) = 24*3^(n-4) for n >= 4.at n=11A026097
• a(n) = n*3^n.at n=8A036290
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.at n=37A038221
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*3^j.at n=43A038221
• Numbers having four 0's in base 9.at n=7A043456
• Numbers k such that the number of divisors of k and sum of squares of divisors of k are relatively prime.at n=37A046679
• Numbers k such that the number of divisors of k and sum of 4th powers of divisors of k are relatively prime.at n=29A046681
• a(1) = 6; for n > 0, a(n+1) = a(n) * (sum of digits of a(n)).at n=4A047898
• Number of nonisomorphic circulant graphs, i.e., undirected Cayley graphs for the cyclic group of order n.at n=40A049287
• First differences of 9^n (A001019).at n=5A055275
• Triangle T(n,k) giving number of fixed 5 X k polyominoes with n cells (n >= 5, 1<=k<=n-4).at n=33A059681
• n*bigomega(n)^n, where bigomega(n) is the number of prime divisors of n, counted with multiplicity.at n=7A061452
• Write n in decimal, omit 0's, replace the k-th digit d[k] with the k-th prime, raised to d[k]-th power and multiply.at n=38A061509