enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Recurring segments on The Colbert Report - Wikipedia

    en.wikipedia.org/wiki/Recurring_segments_on_The...

    1/4/12-1/9/12: Reference to "star-spangled" as in The Star-Spangled Banner: Uptrodden: 1/10/12-As opposed to "downtrodden" Coordinated: 1/12/12: With Stephen's presidential campaign he had to turn his SuperPAC over to Jon Stewart and this was the last day he could coordinate with it. Uncoordinated: 1/16/12: See above. Vote Herman Cain: 1/17/12

  3. Aronson's sequence - Wikipedia

    en.wikipedia.org/wiki/Aronson's_sequence

    [1] Aronson's sequence is closely related to autograms. There are many generalizations of Aronson's sequence and research into the topic is ongoing. [2] Cloitre, Sloane & Vandermast (2003) write that Aronson's sequence is "a classic example of a self-referential sequence." However, they criticize it for being ambiguously defined due to the ...

  4. Square pyramidal number - Wikipedia

    en.wikipedia.org/wiki/Square_pyramidal_number

    All 14 squares in a 3×3-square (4×4-vertex) grid. As well as counting spheres in a pyramid, these numbers can be used to solve several other counting problems. For example, a common mathematical puzzle involves counting the squares in a large n by n square grid. [11] This count can be derived as follows: The number of 1 × 1 squares in the ...

  5. Padovan sequence - Wikipedia

    en.wikipedia.org/wiki/Padovan_sequence

    6 ; 3 + 3 ; 1 + 4 + 1 ; 1 + 1 + 1 + 1 + 1 + 1. The number of ways of writing n as an ordered sum in which each term is odd and greater than 1 is equal to P(n − 5). For example, P(6) = 4, and there are 4 ways to write 11 as an ordered sum in which each term is odd and greater than 1: 11 ; 5 + 3 + 3 ; 3 + 5 + 3 ; 3 + 3 + 5

  6. 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.

  7. Pyramidal number - Wikipedia

    en.wikipedia.org/wiki/Pyramidal_number

    Geometric representation of the square pyramidal number 1 + 4 + 9 + 16 = 30. A pyramidal number is the number of points in a pyramid with a polygonal base and triangular sides. [1] The term often refers to square pyramidal numbers, which have a square base with four sides, but it can also refer to a pyramid with any number of sides. [2]

  8. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    Name First elements Short description OEIS Mersenne prime exponents : 2, 3, 5, 7, 13, 17, 19, 31, 61, 89, ... Primes p such that 2 p − 1 is prime.: A000043 ...

  9. Lucas number - Wikipedia

    en.wikipedia.org/wiki/Lucas_number

    The sequence also has a variety of relationships with the Fibonacci numbers, like the fact that adding any two Fibonacci numbers two terms apart in the Fibonacci sequence results in the Lucas number in between. [3] The first few Lucas numbers are 2, 1, 3, 4, 7, 11, 18, 29, 47, 76, 123, 199, 322, 521, 843, 1364, 2207, 3571, 5778, 9349, ... .