31072

Appears in sequences

• Numbers k such that 1000k+1, 1000k+3, 1000k+7, 1000k+9 are all primes.at n=15A064962
• Let f(m) = number of steps needed to reach a Harshad number when the map k->A062028(l) is iterated starting at m; a(n) = smallest m such that f(m) = n.at n=99A181664
• Number of 3-step one or two space at a time rook's tours on an n X n board summed over all starting positions.at n=24A187288
• Monotonic ordering of nonnegative differences 2^i-10^j, for 40>= i>=0, j>=0.at n=41A192124
• Total sum of parts of multiplicity 3 in all partitions of n.at n=35A222731
• Number of connected dominating sets in the n-triangular graph.at n=4A298104
• a(n) = 2^n*(4*3^n-1).at n=5A321003
• Distance of closest integer power of 10 to the n-th power of 2.at n=17A334588
• Triangle read by rows: the almost-Riordan array ( 1/(1-x) | 2/((1-x)*(1+x+sqrt(5*x^2-6*x+1))), (1-3*x-sqrt(5*x^2-6*x+1))/(2x) ).at n=60A373746