81664

Appears in sequences

• Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 25 (most significant digit on right).at n=14A061978
• Number of permutations of length 2*n-1 with no local maxima in even positions.at n=4A113583
• Number of singly defective permutations of 1..n with exactly 1 maximum.at n=10A183264
• Number of length n+2 0..4 arrays with the medians of every three consecutive terms nondecreasing.at n=5A250136
• T(n,k)=Number of length n+2 0..k arrays with the medians of every three consecutive terms nondecreasing.at n=41A250140
• Number of length 6+2 0..n arrays with the medians of every three consecutive terms nondecreasing.at n=3A250145
• Number of permutations of [1..n] which achieve the worse case bound for a graph domination problem.at n=9A272640
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 169", based on the 5-celled von Neumann neighborhood.at n=16A286174
• Inverse Euler transform of Thue-Morse sequence A001285.at n=38A316149
• Number of 2-color vertex orderings of the labeled path graph on n vertices in which the number 1 is assigned to a vertex in an odd position.at n=8A360514
• a(n) = n*2^(n-1) + binomial(n,2)*2^(n-2) + binomial(n,3)*2^(n-3).at n=11A387185