31225

Appears in sequences

• Stella octangula numbers: a(n) = n*(2*n^2 - 1).at n=25A007588
• Number of rooted n-edge maps on a non-orientable genus-3 surface.at n=2A118451
• Small rhombicuboctahedron with faces of centered polygons.at n=12A193250
• Numbers whose squares have 2R-1 digits, such that the number represented by leftmost R digits and number represented by rightmost R digits divide each other evenly.at n=23A216233
• Triangle read by rows: T(n,k) = number of rooted maps with n edges on a nonorientable surface of genus k (1 <= k <= n).at n=12A267180
• Numbers n such that the decimal number concat(9,n) is a square.at n=31A273364
• Number of nX3 0..1 arrays with every element equal to 0, 3, 4, 6 or 7 king-move adjacent elements, with upper left element zero.at n=20A298662
• Start with the square tile of the Shield tiling and recursively apply the substitution rule. a(n) is the number of squares after n iterations.at n=9A298683
• Terms k of A228058 such that gcd(k - A048250(k), A162296(k) - k) = A162296(k) - k.at n=46A325376
• Position of first occurrence of n in A331410.at n=13A329662
• Number of integer partitions of n having a unique mode.at n=40A362608