32076

Appears in sequences

• Number of partitions of n that do not contain 4 as a part.at n=43A027338
• a(n) = n^3 + (n+1)^3 + (n+2)^3.at n=21A027602
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*11^j.at n=11A038301
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*9^j.at n=13A038323
• Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity).at n=25A046366
• Number of labeled n-node T_0-hypergraphs without multiple hyperedges (empty hyperedge excluded).at n=4A059088
• Number of orbits of length n under a map whose periodic points are counted by A056045.at n=21A060173
• Values of m such that N=(am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,13.at n=14A064243
• Look at all numbers formed by multiplying the parts in a partition of n; a(n) = maximal such number which is divisible by n.at n=32A069188
• Expansion of g.f. c(3x)^2, where c(x) is the g.f. of A000108.at n=5A101600
• Numbers n such that 6*10^n + 3*R_n + 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=20A103033
• Riordan array (1, x*c(3x)), c(x) the g.f. of A000108.at n=30A110518
• Nonoverlapping monocyclic staggered cycloalkanes (unbranched) - see Cyvin reference for precise definition.at n=8A121130
• Numbers with 42 divisors.at n=27A175750
• Numbers of the form p^6*q^2*r where p, q, and r are distinct primes.at n=25A179703
• Inverse of coefficient array for orthogonal polynomials p(n,x)=(x-(2n-1))*p(n-1,x)-(2n-2)^2*p(n-2,x).at n=22A182824
• Numbers n such that prime(n) + reversal(prime(n)) is a square.at n=32A227371
• a(n) = 27*(n - 6)^2 + 4*(n - 6)^3 = ((n - 6)^2)*(4*n + 3).at n=24A245032
• Composites whose prime factorization in base 7 is an anagram of the number in base 7.at n=3A260051
• a(n) = a(n-1) + a(n-2) + 2 a(floor(n/2)) + 3 a(floor(n/3)) + ... + n a(floor(n/n)), where a(0) = 1, a(1) = 2, a(2) = 3.at n=15A298370