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

    The smallest integer m > 1 such that p n # + m is a prime number, where the primorial p n # is the product of the first n prime numbers. A005235 Semiperfect numbers

  3. Longest common subsequence - Wikipedia

    en.wikipedia.org/wiki/Longest_common_subsequence

    The second column and second row have been filled in with ε, because when an empty sequence is compared with a non-empty sequence, the longest common subsequence is always an empty sequence. LCS ( R 1 , C 1 ) is determined by comparing the first elements in each sequence.

  4. Look-and-say sequence - Wikipedia

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

    This variation ultimately ends up repeating the number 21322314 ("two 1s, three 2s, two 3s and one 4"). These sequences differ in several notable ways from the look-and-say sequence. Notably, unlike the Conway sequences, a given term of the pea pattern does not uniquely define the preceding term.

  5. On-Line Encyclopedia of Integer Sequences - Wikipedia

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

    Sequence A073502, the magic constant for n × n magic square with prime entries (regarding 1 as a prime) with smallest row sums, is an example of a sequence with offset 3, and A072171, "Number of stars of visual magnitude n." is an example of a sequence with offset −1.

  6. Generalizations of Fibonacci numbers - Wikipedia

    en.wikipedia.org/wiki/Generalizations_of...

    Every nontrivial Fibonacci integer sequence appears (possibly after a shift by a finite number of positions) as one of the rows of the Wythoff array. The Fibonacci sequence itself is the first row, and a shift of the Lucas sequence is the second row. [4] See also Fibonacci integer sequences modulo n.

  7. Sequence - Wikipedia

    en.wikipedia.org/wiki/Sequence

    In fact, every real number can be written as the limit of a sequence of rational numbers (e.g. via its decimal expansion, also see completeness of the real numbers). As another example, π is the limit of the sequence (3, 3.1, 3.14, 3.141, 3.1415, ...), which is

  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. Magic constant - Wikipedia

    en.wikipedia.org/wiki/Magic_constant

    For example, a normal 8 × 8 square will always equate to 260 for each row, column, or diagonal. The normal magic constant of order n is ⁠ n 3 + n / 2 ⁠. The largest magic constant of normal magic square which is also a: triangular number is 15 (solve the Diophantine equation x 2 = y 3 + 16y + 16, where y is divisible by 4);