33232

Appears in sequences

• a(n) = 6*binomial(n,4) + 3*binomial(n,3) + 4*binomial(n,2) - n + 2.at n=19A066375
• Upper bound on number of regular triangulations of cyclic polytope C(n, n-4).at n=39A066456
• Self-describing integers with the rule: if the digit d, part of the integer i, is odd then there are d odd digits in this integer; if the digit d is even there are d even digits.at n=16A105776
• Any digit d in the sequence says: "I am part of an integer in which you'll find d digits d".at n=20A108571
• Admirable numbers n such that the subtracted divisor is > sqrt(n).at n=39A109321
• a(n) = number of solutions to the Diophantine equation x+y^2+z^3=n^4 with positive x,y,z.at n=23A121876
• Row 4 of table A162430.at n=29A162433
• Numbers d*p where d is a perfect number and p<d a prime not dividing d.at n=25A165772
• Increase each digit in the binary representation of n by 2.at n=26A176894
• List of primitive words over the alphabet {2,3}.at n=47A213971
• Numbers k such that (2*k-1)!! mod k! is greater than (2k+1)!! mod (k+1)!.at n=5A232863
• Numbers which have d digits "d", whenever one of their digits is "d", ordered by largest digit, then by size of the number.at n=18A247700
• Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes such that the maximum of the node outdegrees equals five.at n=9A292231