When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of integer sequences - Wikipedia

    en.wikipedia.org/wiki/List_of_integer_sequences

    "subtract if possible, otherwise add": a(0) = 0; for n > 0, a(n) = a(n − 1) − n if that number is positive and not already in the sequence, otherwise a(n) = a(n − 1) + n, whether or not that number is already in the sequence.

  3. On-Line Encyclopedia of Integer Sequences - Wikipedia

    en.wikipedia.org/wiki/On-Line_Encyclopedia_of...

    In 2010 an OEIS wiki was created to simplify the collaboration ... Sequence #4: 1, 2, 4, 7, 11, 16 ... if we list the sequence of square numbers as 0, 1, 4, 9, 16, 25 ...

  4. Gödel numbering - Wikipedia

    en.wikipedia.org/wiki/Gödel_numbering

    A Gödel numbering can be interpreted as an encoding in which a number is assigned to each symbol of a mathematical notation, after which a sequence of natural numbers can then represent a sequence of symbols. These sequences of natural numbers can again be represented by single natural numbers, facilitating their manipulation in formal ...

  5. Collatz conjecture - Wikipedia

    en.wikipedia.org/wiki/Collatz_conjecture

    As an illustration of this, the parity cycle (1 1 0 0 1 1 0 0) and its sub-cycle (1 1 0 0) are associated to the same fraction ⁠ 5 / 7 ⁠ when reduced to lowest terms. In this context, assuming the validity of the Collatz conjecture implies that (1 0) and (0 1) are the only parity cycles generated by positive whole numbers (1 and 2 ...

  6. Look-and-say sequence - Wikipedia

    en.wikipedia.org/wiki/Look-and-say_sequence

    The look-and-say sequence is also popularly known as the Morris Number Sequence, after cryptographer Robert Morris, and the puzzle "What is the next number in the sequence 1, 11, 21, 1211, 111221?" is sometimes referred to as the Cuckoo's Egg , from a description of Morris in Clifford Stoll 's book The Cuckoo's Egg .

  7. Gilbreath's conjecture - Wikipedia

    en.wikipedia.org/wiki/Gilbreath's_conjecture

    Gilbreath observed a pattern while playing with the ordered sequence of prime numbers 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, ... Computing the absolute value of the difference between term n + 1 and term n in this sequence yields the sequence

  8. Arithmetic progression - Wikipedia

    en.wikipedia.org/wiki/Arithmetic_progression

    For instance, the sequence 5, 7, 9, 11, 13, 15, . . . is an arithmetic progression with a common difference of 2. If the initial term of an arithmetic progression is a 1 {\displaystyle a_{1}} and the common difference of successive members is d {\displaystyle d} , then the n {\displaystyle n} -th term of the sequence ( a n {\displaystyle a_{n ...

  9. ABACABA pattern - Wikipedia

    en.wikipedia.org/wiki/ABACABA_pattern

    DABACABA patterns in (3-bit) binary numbersThe ABACABA pattern is a recursive fractal pattern that shows up in many places in the real world (such as in geometry, art, music, poetry, number systems, literature and higher dimensions).