524291

Appears in sequences

• Numbers that are the sum of 5 positive 9th powers.at n=36A003394
• a(n) = 2^n + 3.at n=19A062709
• a(n) = (2^(n-1) + prime(n+1)-prime(n))/2.at n=20A085431
• (1, 2, 3, 2^2, 5, 2*3, 7, 2^3, 3^2, 2*5, 11, 2^2*3, 13, 2*7, 3*5,..) becomes (1^2+3, 2^2+5, 2^3+7, 2^3+3, 2^2+5, 11^2+2, 3^13+2, 7^3+5,..).at n=23A143709
• a(n) = 2*4^n + 3.at n=9A188161
• 2^p + 3 where p is prime.at n=7A241573
• Numbers of the form 2^k+3 or 3*2^k+1, k >= 2.at n=33A245179
• a(n) = n + 1 when n <= 3, otherwise a(n) = 2^(n-2) + 3; also iterates of A005187 starting from a(1) = 2.at n=20A256994
• a(1) = 1, for n > 1, if n is even, a(n) = A055938(n/2), otherwise a(n) = A005187(a(A064989(n))).at n=72A279337
• a(1) = 1; for n > 1, if n is even, a(n) = A055938(a(n/2)), otherwise a(n) = A005187(a(A064989(n))).at n=72A279339
• a(1) = 1, for n > 1, if n is even, a(n) = A055938(a(n/2)), otherwise a(n) = A005187(a(A268674(n))).at n=72A279349
• Permutation of nonnegative integers: a(n) = A156552(A005940(1+n)-1).at n=51A297164
• a(n) is that generation of the rule-30 1D cellular automaton started from a single ON cell in which n successive OFF cells appears for the first time.at n=43A317530
• a(n) is the smallest n-bit number having the most common prime signature among n-bit numbers. (In case more than one prime signature is tied for most common, choose the smallest n-bit number whose prime signature is one of those tied.)at n=19A342172
• a(0)=4; if n > 0 is even then a(n) = 2^(n/2+1)+3, otherwise a(n) = 3*(2^((n-1)/2)+1).at n=36A343177
• Number of minimal dominating sets in the n-book graph.at n=18A347512