51111

Appears in sequences

• a(0) = 0; for n>0, a(n) is the smallest number greater than a(n-1) which does not use any digit used by a(n-1).at n=39A030283
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 57 ones.at n=3A031825
• Numbers k such that 5*10^k + R_k is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=14A056713
• Self-conjugate digitized partition numbers.at n=16A068325
• Lexicographically earliest increasing sequence of composite numbers such that the digits of a(n) do not appear in a(n-1).at n=33A100373
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 1), (0, 1, -1), (0, 1, 1), (1, -1, 1), (1, 0, 0)}.at n=8A150636
• Number of n X 4 binary arrays with all 1s connected, all corners 1, and no 1 having more than two 1s adjacent.at n=11A163735
• Lexicographically earliest increasing sequence of numbers with all odd digits alternating with numbers with all even digits.at n=36A180412
• Largest n-digit number whose product of digits is n or 0 if no such number exists.at n=4A198376
• Numbers with digital product = 5.at n=14A199985
• Composite numbers whose product of digits is 5.at n=10A201054
• Numbers n = x0 x1 x2...x9 such that xi is the number of digits greater than i in n.at n=41A226195
• Regular triangle where T(n,k) is the number of inequivalent colorings of free pure symmetric multifunctions (with empty expressions allowed) with n positions and k leaves.at n=50A304485
• Numbers whose digit product equals the number of their digits.at n=20A321771
• a(n) is the first number that is a prime times 3^n and ends in exactly n 1's.at n=4A376689