233772

Appears in sequences

• Number of tree-rooted planar maps with 3 faces and n vertices and no isthmuses.at n=20A006470
• a(n) = n*(n-1)^2*(n-2).at n=21A047928
• Erroneous version of A062239, numbers n with property that every digit is a prime factor of n.at n=14A066483
• Numbers n such that core(n)=floor(sqrt(n)), where core(x)=A007913(x) is the squarefree part of x and floor(sqrt(x))=A000196(x).at n=29A069186
• Number of reduced words of length n in Coxeter group on 23 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=4A162809
• Number of ways to place 3 nonattacking knights on an n X n toroidal board.at n=10A172530
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-4.at n=17A180294
• Oblong numbers that are the product of two oblong numbers.at n=26A188660
• Numbers k such that the square part of k is one greater than the squarefree part of k.at n=8A189883
• Consider numbers n = concat(w,x,y,z) such that w*x*y*z | n. Leading zeros in x, y and z allowed. Sequence lists numbers that admit at least two such concatenations.at n=37A257172
• Triangle read by rows: T(n,k) = number of partitions of genus 2 of n elements with k parts (n >= 6, 2 <= k <= n-4).at n=26A297178
• Oblong numbers that are products of smaller oblong numbers.at n=33A374374