23438

Appears in sequences

• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2 and a(3) = 3.at n=17A049911
• 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=27A078612
• Dispersion of A016873, (5k+3), by antidiagonals.at n=29A191705
• Monotonic ordering of set S generated by these rules: if x and y are in S then 3xy-x-y is in S, and 2 is in S.at n=24A192529
• The Matula-Goebel numbers of the rooted trees that have palindromic Wiener polynomials.at n=22A198322
• a(n) = (3*5^n+1)/2.at n=6A199213
• Number of (n+1)X7 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..2 introduced in row major order.at n=0A204074
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..2 introduced in row major order.at n=15A204076
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..2 introduced in row major order.at n=20A204076
• Number of binary words of length n containing no subword 11011.at n=15A210021
• Number of partitions of n with the property that if two summands have the same parity, then their frequencies have the same parity.at n=47A240949
• Permutation of natural numbers, the even bisection of A241909 incremented by one and halved; equally, a composition of A241909 and A048673: a(n) = A048673(A241909(n)).at n=50A243066
• Growth series for affine Coxeter group (or affine Weyl group) D_4.at n=32A266759
• Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 11011; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows.at n=37A277678
• a(n) is the smallest positive integer of length (distance from origin) n in the Cayley graph of the integers generated by all powers of 5.at n=13A294566
• Solution of the complementary equation a(n) = 3*a(n-2) + b(n-1), where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=16A295138
• a(n) = A365399(10^n).at n=5A365485