38228

Appears in sequences

• a(n) is the concatenation of n and 6n.at n=37A009440
• Numbers whose base-2 representation has exactly 14 runs.at n=21A043581
• Number of transitions necessary for a Turing machine to compute the differences between consecutive primes (primes written in unary), when using the instruction table below.at n=32A078612
• a(n) = (7*2^n - 4(-1)^n)/3.at n=14A083595
• a(n) = (7*4^n - 4)/3.at n=7A083597
• Expansion of (1+3x)/((1-x)(1-4x^2)).at n=14A097164
• a(1)=1, a(n) = a(n-1) + (p-1)*p^(n/2-1) if n is even, else a(n) = a(n-1) + p^((n-1)/2), where p=4.at n=14A133628
• Triangle read by rows: t(n,k)=t(n - 1, k - 1) + 4* t(n - 1, k) + 3*t(n - 1, k - 1).at n=37A142597
• Triangle read by rows: t(n,k)=t(n - 1, k - 1) + 4* t(n - 1, k) + 3*t(n - 1, k - 1).at n=43A142597
• A recursive triangle sequence: A(n,k)=k^2*(A(n - 1, k - 1) + A(n - 1, k)).at n=37A156137
• a(n) = (3*2^(n+1) - 8 - (-2)^n)/6.at n=14A176961
• Expansion of (1+2*x+3*x^2-x^3)/((1-x)*(1+x)*(1-2*x)*(1+2*x)).at n=14A221049
• Number of steps required by the Hwang-Deutsch merging algorithm.at n=27A260795
• Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 557", based on the 5-celled von Neumann neighborhood.at n=15A282776