23592

Appears in sequences

• Number of fixed n-celled polyominoes which need only touch at corners.at n=6A006770
• Cycle of 3 steps possible for 'concatenate a(n) and nextprime(a(n)) is a prime'.at n=6A034593
• Numbers whose base-5 representation contains exactly three 2's and three 3's.at n=23A045277
• a(n) = Sum_{r|n, s|n, t|n, r<s<t} r*s*t.at n=43A067817
• Sum of primes < n^2.at n=23A139562
• Terms of A007504 divisible by 3.at n=31A249679
• Number of nX4 arrays of permutations of 4 copies of 0..n-1 with every element equal to at least one vertical or antidiagonal neighbor and the top left element equal to 0.at n=4A268158
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with every element equal to at least one vertical or antidiagonal neighbor and the top left element equal to 0.at n=32A268159
• Number of 5 X n arrays containing n copies of 0..5-1 with every element equal to at least one vertical or antidiagonal neighbor and the top left element equal to 0.at n=3A268162
• Terms of A143407, sorted.at n=46A270564
• a(n) is the number of creatures that can be made from exactly n Palago tiles.at n=17A325936
• G.f.: Product_{k >= 0} ((1 + x^(2*k+1)) / (1 - x^(2*k+1)))^k.at n=33A361008
• Expansion of g.f. A(q) satisfying -3 = Product_{n>=0} (1 - 4*q^n*A(q)).at n=5A370443
• Total area of the bounding boxes of the free polyominoes with n cells.at n=8A379627