19832

Appears in sequences

• a(n) is the smallest number which when written in binary contains as substrings the binary expansions of 1..n.at n=14A056744
• Smallest number containing in its binary representation substrings forming an arithmetic progression exactly of size n.at n=15A091461
• a(2*n+1) = 7*a(n), a(2*n+2) = 8*a(n) + a(n-1).at n=32A116554
• See A134457.at n=18A134466
• See A134457.at n=19A134466
• Numbers k such that, taken together, the base-10 and base-b expansions of k are pandigital for some b < 10.at n=8A174596
• Number of (n+1)X2 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=2A206056
• Number of (n+1)X4 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=0A206058
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=3A206063
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases.at n=5A206063
• Number of cubic plane graphs with 2n nodes, minimal face size 4 and maximal face size 6.at n=26A219748
• Where records occur in A261461.at n=12A261467
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 369", based on the 5-celled von Neumann neighborhood.at n=30A268503
• Record values of A338565.at n=28A338928