27346

Appears in sequences

• Numbers m such that 2*phi(m) = phi(m+1).at n=25A050472
• Least k such that k*10^n+1, k*10^n+3, k*10^n+7 and k*10^n+9 are all prime.at n=8A064281
• 100000000n+1, 100000000n+3, 100000000n+7, 100000000n+9 are all primes.at n=0A064967
• Numbers n such that 2*n*k(n) is rational but not an integer, where k(n) is sum of successive remainders when computing the Euclidean algorithm for (1, 1/sqrt(n)) as defined in A086378 (MuPAD program is given there); numbers belonging to A086378 but not to A088900.at n=19A087414
• Scaled convolution of (n^3)*A000984(n) with A000984(n).at n=21A142962
• 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, 1), (-1, 0, 0), (-1, 1, 1), (1, 0, -1), (1, 1, 0)}.at n=9A149157
• Numbers H(n) where H(2*n)/H(2*n-1) is composed with n times 0-9 and it's the closest number to Pi.at n=0A168215
• Number of nX4 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=4A231059
• Number of nX5 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=3A231060
• T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=31A231063
• T(n,k)=Number of nXk 0..3 arrays x(i,j) with each element horizontally or vertically next to at least one element with value (x(i,j)+1) mod 4, no adjacent elements equal, and upper left element zero.at n=32A231063
• Number of nX5 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=5A279706
• T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=50A279709
• Number of 6Xn 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards.at n=4A279713
• Numbers k such that the concatenation in increasing order of their prime factors, with multiplicity, is congruent to 1 (mod k).at n=8A349705
• Number of subsets of {1..n} with all different first differences of elements.at n=22A364465