32321

Properties

Appears in sequences

• arcsin(arctan(arctanh(x)))=x+1/3!*x^3+17/5!*x^5+505/7!*x^7+32321/9!*x^9...at n=4A012232
• Primes with consecutive digits that differ exactly by 1.at n=14A048398
• Smallest prime p with at least two non-overlapping occurrences of n in decimal representation of p.at n=31A103611
• Beginning with 3, least prime such that concatenation of first n terms and its digit reversal both are primes.at n=29A113584
• Primes p such that p, 120p-1 and 120(p+2)-1 are lesser twin primes.at n=1A122976
• A gap prime-type triangular sequence of coefficients: gap(n)=Prime[n+1]-Prime[n]; t(n,m)=If[n == m == 0, 1, If[m == 0, ((Prime[n] + gap[n])^ n + (Prime[n] - gap[n])^n)/2, ((Prime[n] + gap[n]*Sqrt[Prime[m]])^n + (Prime[n] - gap[n]*Sqrt[Prime[m]])^n)/2]].at n=13A141575
• Primes of the form 20n^2+8n+1.at n=16A154405
• Primes of the form floor(binomial(k,2)/4).at n=40A171574
• Primes of the form A177353(n) + 1 sorted with respect to increasing n.at n=42A178178
• Terms in A048398 ending with 1.at n=2A185893
• Primes formed by concatenating k, k, and 1 for k >= 1.at n=9A210511
• Numbers n such that triangular numbers T(n), T(n+1) and T(n+2) are 3-almost primes.at n=14A255200
• Larger of emirp pairs that are merely reversals of their end digits.at n=25A263242
• Number of n X n 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A300176
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=3A300178
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=24A300182
• Total number of tilings of Ferrers-Young diagrams using dominoes and monominoes summed over all partitions of n.at n=12A304677
• Primes p such that A001175(p) = (p-1)/8.at n=9A308793
• Number of compositions of n where the difference between largest and smallest parts equals eight.at n=14A323125
• Number of configurations of the 5 X 3 variant of the sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square in one of the corners.at n=15A346737