OSPF, which stands for Open Shortest Path First, includes several key features. Routing loops are not common in OSPF due to its use of the Dijkstra algorithm. Triggered updates are indeed supported, allowing the protocol to send updates only when there is a change in the network topology. The shortest path calculation in OSPF is based on metrics such as bandwidth or delay, not just the number of hops. Finally, OSPF supports the concept of dividing an OSPF domain into areas to optimize and manage the network more efficiently. Thus, the correct options are that triggered update is supported and area division is supported.