67006

Appears in sequences

• Pascal-(1,8,1) array.at n=49A143683
• Pascal-(1,8,1) array.at n=50A143683
• Irregular array T(n,k) of the numbers of non-extendable (complete) non-self-adjacent simple paths starting at each of a minimal subset of nodes within a square lattice bounded by rectangles with nodal dimensions n and 8, n >= 2.at n=39A214038
• Bases with a record -- new or tie -- smallest 'stem value' for which a prime by concatenation of decrements exists.at n=29A220402
• Least number x such that x^n has n digits equal to k. Case k = 7.at n=31A285454
• a(n) is the number of decompositions of F(n,1) into disjoint unions of F(j,k) and G(q,r) where F(j,k) is the set of numbers { i*k, 0 <= i <= j } and where G(q,r) is the set of numbers { (2*p-1)*r, 1 <= p <= q }.at n=27A335631