46663

Properties

Appears in sequences

• Sums of 3 distinct powers of 6.at n=20A038479
• a(n) is the smallest prime >= 6^n.at n=6A063766
• a(n) = n^n + n + 1.at n=7A066279
• Primes with either no internal digits or all internal digits are 6.at n=53A069681
• Primes which can be expressed as sum of distinct powers of 6.at n=9A077720
• a(n) = n^3 + 7.at n=36A084377
• Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and containing a total of k level steps H in all DHH...HU's, where U=(1,1), H=(1,0) and D=(1,-1) (can be easily expressed using RNA secondary structure terminology).at n=61A097107
• Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n containing k DHH...HU's, where U=(1,1), D=(1,-1) and H=(1,0) (can be easily expressed using RNA secondary structure terminology).at n=31A098083
• Smallest prime larger than n^n.at n=5A098682
• Primes of the form k^k + 7.at n=2A100841
• Primes of the form 6^n+7.at n=4A104115
• Primes such that the outer 2 digits are n and n-1 and all inner digits are 6, where 0 < n < 9.at n=2A108834
• Prime Friedman numbers.at n=34A112419
• Rectangular table where column k equals row sums of matrix power A097712^k, read by antidiagonals.at n=39A125860
• Column 3 of table A125860; also equals row sums of matrix power A097712^3.at n=5A125863
• Smallest prime of the form k*prime(n+1)+prime(n) = j*prime(n+2)+prime(n+1) for free integer multipliers k and j.at n=15A129918
• Beastly primes (version 2): primes containing 666 as a substring.at n=3A131645
• Primes of the form a^a + b^b + c^c + d^d + e^e.at n=26A136292
• Integers N such that by inserting + or - or * or / or ^ between each of their digits, without any grouping parentheses, you can get N (the ambiguous a^b^c is avoided).at n=25A156954
• a(1)=2, a(n+1) is the smallest prime > n^smallest digit of a(n).at n=36A158061