93528

Appears in sequences

• Numerators of continued fraction convergents to sqrt(208).at n=8A041386
• Number of planar partitions of n, but partitions that are mirror images of each other (when regarded as 3-D objects) are counted only once.at n=21A048140
• Scaled Chebyshev U-polynomials evaluated at i*sqrt(6)/2. Generalized Fibonacci sequence.at n=6A057089
• Triangular numbers which are 7-almost primes.at n=30A076581
• a(n) = p(n)*(p(n)-1)/2 where p(n) = upper member of n-th pair of twin primes.at n=22A082669
• a(n) is the (1,2)-entry of the n-th power of the 2 X 2 matrix [0,1;n-1,n-1].at n=6A109516
• Triangular numbers that can be written as sum of two positive cubes.at n=7A113958
• Triangular numbers that are the product of 2 palindromes greater than 1.at n=39A115744
• Triangular numbers equal to the sum of a prime number with its index.at n=31A115886
• Triangular numbers for which the sum of the digits is a cube.at n=31A117803
• a(n) = n^3 + (n+2)^3.at n=35A153976
• 4-loop graph coloring a rectangular array: number of n X 2 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=4A223291
• 4-loop graph coloring a rectangular array: number of nX5 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=1A223294
• 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=16A223297
• 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=19A223297
• Number of 3Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or zero plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=13A241257
• Numbers k such that the symmetric representation of sigma(k) has only two parts and they meet at the center of the Dyck path.at n=23A262259
• a(n) = 4*n*(4*n^2 + 3).at n=18A271636
• Least number x such that x^n has n digits equal to k. Case k = 9.at n=32A285456
• Triangular numbers t(n) with a zeroless decimal representation such that (product of decimal digits of t(n)) / n is an integer.at n=6A307812