Search results
Results from the WOW.Com Content Network
A positive integer that can be written as the sum of two or more consecutive positive integers. A138591: Erdős–Nicolas numbers: 24, 2016, 8190, 42336, 45864, 392448, 714240, 1571328, ... A number n such that there exists another number m and , =. A194472: Solution to Stepping Stone Puzzle
The harmonic mean of a set of positive integers is the number of numbers times the reciprocal of the sum of their reciprocals. The optic equation requires the sum of the reciprocals of two positive integers a and b to equal the reciprocal of a third positive integer c. All solutions are given by a = mn + m 2, b = mn + n 2, c = mn.
A pronic number is a number that is the product of two consecutive integers, that is, a number of the form (+). [1] The study of these numbers dates back to Aristotle.They are also called oblong numbers, heteromecic numbers, [2] or rectangular numbers; [3] however, the term "rectangular number" has also been applied to the composite numbers.
Standard ML: The optional built-in IntInf structure implements the INTEGER signature and supports arbitrary-precision integers. Tcl: As of version 8.5 (2007), integers are arbitrary-precision by default. (Behind the scenes, the language switches to using an arbitrary-precision internal representation for integers too large to fit in a machine word.
Number of consecutive integers starting with n needed to sum to a Niven number. Jul 8, 2005: A112886: Triangle-free positive integers. Jan 12, 2006: A120007: Möbius transform of sum of prime factors of n with multiplicity. Jun 2, 2006
In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational approximations to the square root of 2. This sequence of approximations begins 1 / 1 , 3 / 2 , 7 / 5 , 17 / 12 , and 41 / 29 , so the sequence of Pell ...
The number of compositions of nonnegative integers into parts that are at most is a Fibonacci sequence of order . The sequence of the number of strings of 0s and 1s of length m {\displaystyle m} that contain at most n {\displaystyle n} consecutive 0s is also a Fibonacci sequence of order n {\displaystyle n} .
The transitivity of M implies that the integers and integer sequences inside M are actually integers and sequences of integers. An integer sequence is a definable sequence relative to M if there exists some formula P ( x ) in the language of set theory, with one free variable and no parameters, which is true in M for that integer sequence and ...