196602

Appears in sequences

• Start with a single triangle; at n-th generation add a triangle at each vertex, allowing triangles to overlap; sequence gives number of triangles in n-th generation.at n=30A061776
• a(1) = 1; thereafter a(n) = 6*(2^(n-1) - 1).at n=15A068293
• Numbers n which when converted to base 8, reversed and converted back to base 10 yield a number m such that n mod m = 0. Cases which are trivial or result in digit loss are excluded.at n=17A091082
• Base-10 representation of numbers k which, in base 2, satisfy abs(k + reverse(k) - reverse(k + reverse(k))) = abs(k - reverse(k)) + reverse(abs(k - reverse(k))) = k.at n=17A179697
• Rows of A219463 seen as numbers in binary representation.at n=18A219843
• Smallest number m such that the GCD of the x's that satisfy sigma(x)=m is n.at n=9A241625
• Decimal representation of the n-th iteration of the "Rule 165" elementary cellular automaton starting with a single ON (black) cell.at n=9A267247
• Number of vertex cuts in the n X n rook complement graph.at n=6A362576
• Number of compositions of n such that between any pair of equal adjacent parts there can be a pair of brackets enclosing a new nonempty composition with the same rules.at n=13A383765