enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Fuse cutout - Wikipedia

    en.wikipedia.org/wiki/Fuse_cutout

    In electrical distribution, a fuse cutout or cut-out fuse (often referred to as a cutout) is a combination of a fuse and a switch, used in primary overhead feeder lines and taps to protect distribution transformers from current surges and overloads. An overcurrent caused by a fault in the transformer or customer circuit will cause the fuse to ...

  3. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    Name First elements Short description OEIS Kolakoski sequence: 1, 2, 2, 1, 1, 2, 1, 2, 2, 1, ... The n th term describes the length of the n th run : A000002: Euler's ...

  4. Recloser - Wikipedia

    en.wikipedia.org/wiki/Recloser

    The ratings of reclosers run from 2.4–38 kV for load currents from 10–1200 A and fault currents from 116 kA. [ 7 ] [ 8 ] On a 3-phase circuit, a recloser is more beneficial than three separate fuse cutouts .

  5. 1/2 + 1/4 + 1/8 + 1/16 + ⋯ - ⋯ - Wikipedia

    en.wikipedia.org/wiki/1/2_%2B_1/4_%2B_1/8_%2B_1/...

    First six summands drawn as portions of a square. The geometric series on the real line. In mathematics, the infinite series ⁠ 1 / 2 ⁠ + ⁠ 1 / 4 ⁠ + ⁠ 1 / 8 ⁠ + ⁠ 1 / 16 ⁠ + ··· is an elementary example of a geometric series that converges absolutely.

  6. Integer sequence - Wikipedia

    en.wikipedia.org/wiki/Integer_sequence

    (the Fibonacci sequence) is formed by starting with 0 and 1 and then adding any two consecutive terms to obtain the next one: an implicit description (sequence A000045 in the OEIS). The sequence 0, 3, 8, 15, ... is formed according to the formula n 21 for the n th term: an explicit definition.

  7. Lazy caterer's sequence - Wikipedia

    en.wikipedia.org/wiki/Lazy_caterer's_sequence

    The maximum number of pieces from consecutive cuts are the numbers in the Lazy Caterer's Sequence. When a circle is cut n times to produce the maximum number of pieces, represented as p = f (n), the n th cut must be considered; the number of pieces before the last cut is f (n − 1), while the number of pieces added by the last cut is n.

  8. 1 + 2 + 4 + 8 + ⋯ - ⋯ - Wikipedia

    en.wikipedia.org/wiki/1_%2B_2_%2B_4_%2B_8_%2B_%E...

    The first four partial sums of 1 + 2 + 4 + 8 + ⋯. In mathematics, 1 + 2 + 4 + 8 + ⋯ is the infinite series whose terms are the successive powers of two. As a geometric series, it is characterized by its first term, 1, and its common ratio, 2. As a series of real numbers it diverges to infinity, so the sum of this series is infinity.

  9. Geometric progression - Wikipedia

    en.wikipedia.org/wiki/Geometric_progression

    For example, the sequence 2, 6, 18, 54, ... is a geometric progression with a common ratio of 3. Similarly 10, 5, 2.5, 1.25, ... is a geometric sequence with a common ratio of 1/2. Examples of a geometric sequence are powers r k of a fixed non-zero number r, such as 2 k and 3 k. The general form of a geometric sequence is