32143

Properties

Appears in sequences

• a(n) = 8^n - n^4.at n=5A024092
• First term of strong prime sextets: p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2) > p(m+4)-p(m+3) > p(m+5)-p(m+4).at n=8A054813
• a(1) = 2; a(n) = smallest prime > a(n-1) such that the sum of any three nondecreasing terms, chosen from a(1), ..., a(n-1) and a(n), is unique.at n=21A060276
• Number of base 31 circular n-digit numbers with adjacent digits differing by 1 or less.at n=8A124803
• Primes of the form x^5-y^4, where x,y >= 1.at n=8A161747
• Monotonic ordering of nonnegative differences 8^i-5^j, for 40>= i>=0, j>=0.at n=18A192198
• Triangle of coefficients of polynomials v(n,x) jointly generated with A210600; see the Formula section.at n=49A210601
• Numbers n such that prime(n) + reversal(prime(n)) is a square.at n=33A227371
• Smallest of five consecutive primes in arithmetic progression with common difference 90 and equal digit sums.at n=23A253232
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 825", based on the 5-celled von Neumann neighborhood.at n=30A273581
• a(n) is the smallest prime p such that there is a multiplicative subgroup H of Z/pZ, of odd size and of index 2n, such that for any two cosets H1 and H2 of H, H1 + H2 contains all of (Z/pZ)\0.at n=32A282001
• a(n) = n^2 + 2329*n + 1697.at n=13A301985
• Number of nonnegative lattice paths from (0,0) to (n,0) using steps in {(1,-4), (1,-1), (1,0), (1,1)}.at n=12A348202
• Emirps p such that if q is the next emirp after p, 2*q-p is also an emirp.at n=31A350852
• Prime numbersat n=3449