34679

Properties

Appears in sequences

• Largest n-digit prime with strictly increasing digits.at n=4A071363
• Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.at n=32A083809
• In binary representation of n, replace ones with n and zeros with n's binary complement (keeping leading zeros).at n=8A100241
• Numbers k such that (12^k + 5^k)/17 is prime.at n=8A128341
• a(n) = 30*n^2 - 1.at n=33A158560
• a(1) = 17, a(n) is smallest prime of the form k*a(n - 1) + 1.at n=4A214632
• Number of partitions p of n including round(mean(p)) as a part. (This is "Mathematica round").at n=43A241338
• Number of partitions p of n such that round(mean(p)) is a part of p; here, round(x) means floor(x + 1/2).at n=43A241733
• Triangle of generalized Eulerian numbers T(n,k) = <n,k>_3 read by rows, n >= 1, 0 <= k <= 3*(n-1).at n=27A269743
• Triangle of generalized Eulerian numbers T(n,k) = <n,k>_3 read by rows, n >= 1, 0 <= k <= 3*(n-1).at n=29A269743
• Balanced primes of order thirteen.at n=14A300364
• Primes p such that A001175(p) = (p-1)/7.at n=24A308792
• Primes p such that A001177(p) = (p-1)/7.at n=16A308800
• Prime numbersat n=3704