1000000009

Appears in sequences

• Integers that are equal to the sum of ascending numbers raised to their digits powers.at n=4A035138
• Least n-digit 'happy' prime.at n=9A046519
• Numbers k such that k^2 contains only digits {0,1,8}, not ending with zero.at n=23A058421
• Harmless numbers: numbers without a, h, m or r.at n=54A073416
• Smallest n-digit prime with digit sum n, or 0 if no such prime exists.at n=9A073864
• Final entry in n-th row of triangle in A080524.at n=9A080526
• Leading terms of rows in A081551.at n=9A081552
• Numbers of the form 10^k + 1, 3, 7, or 9 for k>=1.at n=35A088265
• For any prime p, define a sequence S_p: S_p(1) = p and S_p(n+1) is the least prime > S_p(n) that begins with the last digit of S_p(n). Let f(p) be the first member of S_p that is the digit reversal of the previous member. Sequence contains primes p that such that f(p) does not equal f(q) for any q < p.at n=13A089592
• Smallest n-digit prime containing no prime substrings, or 0 if no such number exists.at n=9A089770
• First prime in primes of the form 10^n + 10^(n-k) - 1.at n=7A096214
• Primes at Levenshtein distance n from previous value when considered as a decimal string.at n=10A109809
• Happy primes of the form a*10^k + b with single-digit a and b, a > 0, k > 0.at n=32A109902
• Least hypotenuse of primitive Pythagorean triangle exceeding 10^n.at n=9A117340
• Array read by rows: row n lists the first two primes with n digits.at n=19A139052
• Array read by rows: row n lists the first 3 primes with n digits.at n=28A139053
• Prime numbers of the form 10^k +- 9.at n=7A144246
• a(n) = n^(n-1) + n - 1.at n=9A173235
• Primes of the form k^(k-1) + k - 1.at n=3A177008
• Smallest n-digit emirp with only nonprime digits.at n=7A177850