38688

Appears in sequences

• Number of points on surface of truncated cube: a(n) = 46*n^2 + 2 for n > 0.at n=29A005911
• Possible traces of n-step walks on 1-D lattice, ignoring translations.at n=19A048248
• Sum of divisors of floor(Pi*10^n), Pi=3.14...at n=4A089285
• Number of configurations of Sam Loyd's sliding block 15-puzzle that require a minimum of n moves to be reached, starting with the empty square at one of the 8 non-corner boundary squares.at n=14A090165
• a(n) = n*(n+1)*(7*n^2 - n - 4)/4.at n=12A172077
• Numbers k such that the sum of the divisors of k and the sum of the distinct prime divisors of k are both a square.at n=33A194196
• 4-loop graph coloring a rectangular array: number of n X 1 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=7A223290
• T(n,k)=4-loop graph coloring a rectangular array: number of nXk 0..8 arrays where 0..8 label nodes of a graph with edges 0,1 1,2 2,0 0,3 3,4 4,0 0,5 5,6 6,0 0,7 7,8 8,0 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph.at n=28A223297
• Triangle read by rows: Cayley's numbers phi(m,n) (m,n>=0). Row m contains phi(m,0), phi(m-1,1), phi(m-2,2), ..., phi(0,m).at n=39A260338
• Number of (n+2)X(3+2) 0..1 arrays with each row divisible by 5 and column not divisible by 5, read as a binary number with top and left being the most significant bits.at n=3A262790
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each row divisible by 5 and column not divisible by 5, read as a binary number with top and left being the most significant bits.at n=18A262795
• Number of (4+2)X(n+2) 0..1 arrays with each row divisible by 5 and column not divisible by 5, read as a binary number with top and left being the most significant bits.at n=2A262799
• a(n) is the number of prime powers k such that ceiling(log_2(k)) = n.at n=19A304521
• Irregular table read by rows: T(n,k) = number of k-gons, k >= 3, formed inside a triangle with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,m)/A006843(n,m), m = 1..A005728(n).at n=27A358951