32497

Properties

Appears in sequences

• Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=42A127022
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 0, 0), (0, -1, -1), (1, 1, 1)}.at n=9A149507
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (-1, 1, 1), (0, -1, 1), (1, 0, -1), (1, 1, 1)}.at n=8A149784
• Smaller member p of a pair (p,p+6) of consecutive primes in different centuries.at n=25A160370
• Primes of the form 10 * k^2 + 7.at n=27A195905
• Primes p such that 2*p + 31 is a square.at n=15A269786
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 659", based on the 5-celled von Neumann neighborhood.at n=28A273386
• Numbers k such that (13*10^k + 197)/3 is prime.at n=25A276311
• Number of Hamiltonian paths in the graph on n vertices {1,...,n}, with i adjacent to j iff |i-j| in {1,3}.at n=22A302119
• a(n) = Sum_{k=1..n} Stirling2(n,k) * gcd(n,k).at n=8A329969
• a(n) = (1/2) * Sum_{k=0..floor(n/3)} 2^k * binomial(2*n-4*k+2,2*k+1).at n=12A387600
• Prime numbersat n=3487