34120

Appears in sequences

• a(n+1) = a(n) converted to base 8 from base 6 (written in base 10).at n=16A023385
• a(n) = 2*binomial(3*n, n) - Sum_{k=0..n} binomial(3*n, k).at n=7A047098
• a(n) = Sum_{k=1..n} C(n, floor(n/k)).at n=17A051054
• Number triangle associated to the Riordan arrays (1/(1+x),x/(1+x)^k),k>=0.at n=62A107027
• Number triangle associated with the Riordan arrays (1/(1+x),x/(1+x)^k),k>=0.at n=58A107030
• Expansion of f(x^3)/(1-x*f(x^3)), where f(x) is the g.f. of A001764, whose n-th term is binomial(3n,n)/(2n+1).at n=21A126042
• Sequence s_n arising in enumeration of arrays of directed blocks (see Quaintance reference for precise definition).at n=12A129873
• Number of n X n arrays of squares of integers summing to 26 with every element equal to at least one neighbor.at n=2A146520
• Numbers k for which there are no prime numbers in the range (k-4*sqrt(sqrt(k)), k].at n=37A192320
• Number of -n..n arrays x(0..4) of 5 elements with zero sum, adjacent elements differing by more than one, and elements alternately increasing and decreasing.at n=10A200194
• Numbers whose digits are a permutation of [0,...,n] and which contain the product of any two adjacent digits as a substring.at n=27A203569
• Number A(n,k) of 3n-length k-ary words that can be built by repeatedly inserting triples of identical letters into the initially empty word; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=52A213028
• Let an integer with k+1 digits as n = d(k)*10^k + d(k-1)*10^(k-1) + ... + d(0)*10^0 and consider the transform T(n) = k*10^d(k) + (k-1)*10^d(k-1) + ... + 0*10^d(0). a(n) gives the fixed points of the transform T(n).at n=26A226767
• Number of (n+2) X (1+2) 0..3 arrays with every 3 X 3 subblock row, column, diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=8A252362
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 1 3 4 6 or 7.at n=36A252369
• Numbers k such that 2^k - Lucas(k) is prime.at n=20A292614
• Integers x such that [f(0), f(f(0)), ..., f(...f(0)...)] is a permutation of [0, 1, ..., k-1], where k is the number of digits in x and f(a) denotes the 0-based index of the first occurrence of the substring a in x.at n=27A307620
• Number of length n necklaces with entries covering an initial interval of positive integers and no adjacent entries equal.at n=7A330620