49069

Properties

Appears in sequences

• a(n) = round(10000*log_2(n)).at n=29A004269
• Primes that are palindromic in base 6.at n=33A029974
• a(1) = 2; for n > 1, a(n) = largest prime not exceeding a(1) + ... + a(n-1).at n=16A068524
• Lexicographically earliest infinite sequence of distinct positive numbers with the property that every positive integer is a sum of distinct terms (see algorithm below).at n=16A075058
• Primes p such that (p reversed) +6 is a square.at n=19A167472
• Start with a single hexagon; at n-th generation add a hexagon at each expandable vertex; a(n) is the sum of all label values at n-th generation. (See comment for construction rules.)at n=12A247620
• Balanced primes of order one ending in 9.at n=21A303095
• Primes p1 such that the sum of 9 consecutive primes, p1+p2+p3+p4+p5+p6+p7+p8+p9, and the three sums (p1+p2+p3), (p4+p5+p6), (p7+p8+p9) are all prime numbers.at n=19A343683
• a(0) = 0; thereafter a(n) = a(n-1)/2 + n if a(n-1) is even, otherwise a(n) = a(n-1) + a(n-2).at n=38A350129
• a(n) is the smallest prime p such that the Diophantine equation x^3 + y^3 + z^3 = p^3, where 0 < x <= y <= z has exactly n positive integer solutions.at n=11A377372
• Primes p for which there exists more than one triple of primes q, r, s such that p^3 = q^3 + r^3 + s^3.at n=2A384553
• Primes having only {0, 4, 6, 9} as digits.at n=30A386073
• Prime numbersat n=5044