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

    A number that has the same number of digits as the number of digits in its prime factorization, including exponents but excluding exponents equal to 1. A046758 Extravagant numbers

  3. On-Line Encyclopedia of Integer Sequences - Wikipedia

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

    Second edition of the book. Neil Sloane started collecting integer sequences as a graduate student in 1964 to support his work in combinatorics. [8] [9] The database was at first stored on punched cards.

  4. de Bruijn sequence - Wikipedia

    en.wikipedia.org/wiki/De_Bruijn_sequence

    For example, a digital door lock with a 4-digit code (each digit having 10 possibilities, from 0 to 9) would have B (10, 4) solutions, with length 10 000. Therefore, only at most 10 000 + 3 = 10 003 (as the solutions are cyclic) presses are needed to open the lock, whereas trying all codes separately would require 4 × 10 000 = 40 000 presses.

  5. Integer sequence - Wikipedia

    en.wikipedia.org/wiki/Integer_sequence

    An integer sequence is computable if there exists an algorithm that, given n, calculates a n, for all n > 0. The set of computable integer sequences is countable.The set of all integer sequences is uncountable (with cardinality equal to that of the continuum), and so not all integer sequences are computable.

  6. Repeating decimal - Wikipedia

    en.wikipedia.org/wiki/Repeating_decimal

    The period of ⁠ c / k ⁠, for c coprime to k, equals the period of ⁠ 1 / k ⁠. If k = 2 a ·5 b n where n > 1 and n is not divisible by 2 or 5, then the length of the transient of ⁠ 1 / k ⁠ is max(a, b), and the period equals r, where r is the multiplicative order of 10 mod n, that is the smallest integer such that 10 r ≡ 1 (mod n).

  7. Look-and-say sequence - Wikipedia

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

    If started with any digit d from 0 to 9 then d will remain indefinitely as the last digit of the sequence. For any d other than 1, the sequence starts as follows: d, 1d, 111d, 311d, 13211d, 111312211d, 31131122211d, … Ilan Vardi has called this sequence, starting with d = 3, the Conway sequence (sequence A006715 in the OEIS).

  8. Primes in arithmetic progression - Wikipedia

    en.wikipedia.org/wiki/Primes_in_arithmetic...

    For example, the AP-3 {3, 7, 11} does not qualify, because 5 is also a prime. For an integer k3, a CPAP-k is k consecutive primes in arithmetic progression. It is conjectured there are arbitrarily long CPAP's. This would imply infinitely many CPAP-k for all k. The middle prime in a CPAP-3 is called a balanced prime.

  9. Sequence number - Wikipedia

    en.wikipedia.org/wiki/Sequence_number

    A sequence number is a consecutive number in a sequence of numbers, usually of real integers (natural numbers).Sequence numbers have many practical applications. They can be used, among other things, as part of serial numbers on manufactured parts, in case management, [1] or in databases as a surrogate key for registering and identifying unique entries in a table [2] [3] (in which case it is ...