52668

Appears in sequences

• Degrees of irreducible representations of O'Nan group ON.at n=10A003919
• Expansion of (1-4*x)^(11/2).at n=17A020923
• Engel expansion of sinh(1/3).at n=38A068380
• Numbers occurring twice in A068627.at n=33A068628
• Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)).at n=53A132883
• Triangle read by rows: T(n,k) is the number of non-crossing connected graphs on n nodes on a circle having root (a distinguished node) of degree 1 and having k edges (n >= 2, 1 <= k <= 2n-4).at n=51A143024
• Convolution of A008805 (triangular numbers repeated) with itself.at n=35A177747
• Numbers with prime factorization pqrs^2t^2.at n=30A189989
• a(n) = number of ordered triples (w,x,y) such that w,x,y are all in {0,...,n} and the numbers |w-x|, |x-y|, |y-w| are distinct.at n=38A212963
• Number of ways 2*n-1 people can vote on three candidates so that the Condorcet paradox arises.at n=18A277935
• Number of dispersed Dyck prefixes of length 2n and height n.at n=11A283799
• Numbers k satisfying gcd(k^2, sigma(k^2)) > sigma(k), where sigma is the sum-of-divisors function.at n=25A322154
• a(n) is the index of the first occurrence of n in A331284.at n=31A331285
• a(n) is the smallest integer that has exactly n Lucas divisors (A000032).at n=7A356062
• a(n) is the least practical number A005153(k) such that A005153(k+1) - A005153(k) = 2*n, or -1 if no such number exists.at n=15A364707
• a(n) is the smallest positive integer y such that there exists an integer x such that binomial(x + i*y, n) is a Gaussian integer.at n=18A387569
• a(n) is the smallest positive integer y such that there exists an integer x such that binomial(x + i*y, n) is a Gaussian integer.at n=20A387569