32111

Appears in sequences

• Graham-Sloane-type lower bound on the size of a ternary (n,3,6) constant-weight code.at n=12A030506
• Composite numbers x such that sigma(x+120) = sigma(x)+120.at n=32A054985
• Roman numerals written using 1 for I, 2 for V, 3 for X, 4 for L, 5 for C, 6 for D, 7 for M.at n=17A061493
• The zero-free, right-to-left factorial walk encoding for each rooted plane tree encoded by A014486. Sequence A071155 shown with factorial expansion (A007623).at n=27A071157
• a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) + a(n-4).at n=12A093406
• Digit reversal of A096299(n).at n=18A096104
• a(n) = Sum_{k=0..n} C(n,4k)*2^k.at n=15A097081
• Numbers k such that k and k^2 use only the digits 0, 1, 2, 3 and 6.at n=53A136812
• Composite numbers whose product of digits is 6.at n=36A201055
• Numbers that eventually reach 1 under "x -> sum of 4th power of digits of x".at n=24A219111
• Concatenation of multiplicities of prime divisors of highly composite numbers A002182(n).at n=24A245500
• Number k such that k^2 + 1 = p*q*r where p,q,r are distinct primes and the sum p+q+r is a perfect square.at n=16A261529
• Square array of distinct positive integers A(n, k), n, k > 0, read and filled the greedy way by antidiagonals upwards such that the concatenations of the terms of two distinct rows are always equal.at n=24A363931