32208

Appears in sequences

• Number of aperiodic necklaces of n beads of 11 colors.at n=4A032166
• Jacobi form of weight 12 and index 1 for Niemeier lattice of type A_2^12.at n=7A055765
• Difference between the product of two consecutive primes and the next prime.at n=40A111071
• a(n) = n! * Sum_{k=1..n} binomial(2n+1,k)/k.at n=4A129840
• Numbers k such that the sum of the Carmichael lambda functions of the divisors is a proper divisor of k.at n=22A131492
• Sum of staircase twin primes according to the rule: top * bottom - next top.at n=12A135285
• a(n) = ((prime(n))^5-prime(n))/5.at n=4A138426
• Number of nX3 1..3 arrays containing at least one of each value, and all equal values connected.at n=4A166762
• Number of nX5 1..3 arrays containing at least one of each value, and all equal values connected.at n=2A166770
• The path length of the Fibonacci tree of order n.at n=16A178523
• Number of (n+1)X2 0..3 arrays with the number of clockwise edge increases in 2X2 subblocks nondecreasing rightwards and downwards.at n=2A205928
• Number of (n+1)X4 0..3 arrays with the number of clockwise edge increases in 2X2 subblocks nondecreasing rightwards and downwards.at n=0A205930
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in 2X2 subblocks nondecreasing rightwards and downwards.at n=3A205935
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the number of clockwise edge increases in 2X2 subblocks nondecreasing rightwards and downwards.at n=5A205935
• Number of 5-bead necklaces of n colors not allowing reversal, with no adjacent beads having the same color.at n=11A208536
• Begin with a(0) = 3. Let a(n) for n > 0 be the smallest positive integer not yet in the sequence which forms part of a Pythagorean triple when paired with a(n-1).at n=44A235598
• Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.at n=3A267628
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.at n=31A267629
• Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any west neighbor modulo 4 and the upper left element equal to 0.at n=4A267630
• Number of ways to write n as an ordered sum of nine powers of 2.at n=30A342252