List Of OEIS Sequences
This is a list of notable integer sequences and their OEIS links. General Figurate numbers Types of primes Base-dependent References OEIS core sequences External links Index to OEIS {{DEFAULTSORT:OEIS sequences * Integer An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign (−1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ... On-Line Encyclopedia of Integer Sequences ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Integer Sequence
In mathematics, an integer sequence is a sequence (i.e., an ordered list) of integers. An integer sequence may be specified ''explicitly'' by giving a formula for its ''n''th term, or ''implicitly'' by giving a relationship between its terms. For example, the sequence 0, 1, 1, 2, 3, 5, 8, 13, ... (the Fibonacci sequence) is formed by starting with 0 and 1 and then adding any two consecutive terms to obtain the next one: an implicit description. The sequence 0, 3, 8, 15, ... is formed according to the formula ''n''2 − 1 for the ''n''th term: an explicit definition. Alternatively, an integer sequence may be defined by a property which members of the sequence possess and other integers do not possess. For example, we can determine whether a given integer is a perfect number, even though we do not have a formula for the ''n''th perfect number. Examples Integer sequences that have their own name include: *Abundant numbers *Baum–Sweet sequence *Bell numbe ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Pell Number
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 , , , , and , so the sequence of Pell numbers begins with 1, 2, 5, 12, and 29. The numerators of the same sequence of approximations are half the companion Pell numbers or Pell–Lucas numbers; these numbers form a second infinite sequence that begins with 2, 6, 14, 34, and 82. Both the Pell numbers and the companion Pell numbers may be calculated by means of a recurrence relation similar to that for the Fibonacci numbers, and both sequences of numbers grow exponentially, proportionally to powers of the silver ratio 1 + . As well as being used to approximate the square root of two, Pell numbers can be used to find square triangular numbers, to construct integer approximations to the right isosceles triangle, and to solve certain combinat ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Prime Power
In mathematics, a prime power is a positive integer which is a positive integer power of a single prime number. For example: , and are prime powers, while , and are not. The sequence of prime powers begins: 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 243, 251, … . The prime powers are those positive integers that are divisible by exactly one prime number; in particular, the number 1 is not a prime power. Prime powers are also called primary numbers, as in the primary decomposition. Properties Algebraic properties Prime powers are powers of prime numbers. Every prime power (except powers of 2) has a primitive root; thus the multiplicative group of integers modulo ''p''''n'' (i.e. the group of units of the ring Z/''p''''n''Z) is ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Lucky Number
In number theory, a lucky number is a natural number in a set which is generated by a certain "sieve". This sieve is similar to the Sieve of Eratosthenes that generates the primes, but it eliminates numbers based on their position in the remaining set, instead of their value (or position in the initial set of natural numbers). The term was introduced in 1956 in a paper by Gardiner, Lazarus, Metropolis and Ulam. They suggest also calling its defining sieve, "the sieve of Josephus Flavius" because of its similarity with the counting-out game in the Josephus problem. Lucky numbers share some properties with primes, such as asymptotic behaviour according to the prime number theorem; also, a version of Goldbach's conjecture has been extended to them. There are infinitely many lucky numbers. Twin lucky numbers and twin primes also appear to occur with similar frequency. However, if ''L''''n'' denotes the ''n''-th lucky number, and ''p''''n'' the ''n''-th prime, then ''L''''n'' > ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Euclid–Mullin Sequence
The Euclid–Mullin sequence is an infinite sequence of distinct prime numbers, in which each element is the least prime factor of one plus the product of all earlier elements. They are named after the ancient Greek mathematician Euclid, because their definition relies on an idea in Euclid's proof that there are infinitely many primes, and after Albert A. Mullin, who asked about the sequence in 1963. The first 51 elements of the sequence are :2, 3, 7, 43, 13, 53, 5, 6221671, 38709183810571, 139, 2801, 11, 17, 5471, 52662739, 23003, 30693651606209, 37, 1741, 1313797957, 887, 71, 7127, 109, 23, 97, 159227, 643679794963466223081509857, 103, 1079990819, 9539, 3143065813, 29, 3847, 89, 19, 577, 223, 139703, 457, 9649, 61, 4357, 87991098722552272708281251793312351581099392851768893748012603709343, 107, 127, 3313, 227432689108589532754984915075774848386671439568260420754414940780761245893, 59, 31, 211... These are the only known elements . Finding the next one requires finding the leas ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Padovan Sequence
In number theory, the Padovan sequence is the sequence of integers ''P''(''n'') defined. by the initial values :P(0)=P(1)=P(2)=1, and the recurrence relation :P(n)=P(n-2)+P(n-3). The first few values of ''P''(''n'') are :1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, ... A Padovan prime is a Padovan number that's also prime. The first Padovan primes are: :2, 3, 5, 7, 37, 151, 3329, 23833, 13091204281, 3093215881333057, 1363005552434666078217421284621279933627102780881053358473, 1558877695141608507751098941899265975115403618621811951868598809164180630185566719, ... . The Padovan sequence is named after Richard Padovan who attributed its discovery to Netherlands, Dutch architect Hans van der Laan in his 1994 essay ''Dom. Hans van der Laan : Modern Primitive''.Richard Padovan. ''Dom Hans van der Laan: modern primitive'': Architectura & Natura Press, . The sequence was described by Ian Stewart (mathematician), Ian Stewart in his Scientific Ame ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Narayana's Cows
Nārāyaṇa Paṇḍita ( sa, नारायण पण्डित) (1340–1400) was an Indian mathematician. Plofker writes that his texts were the most significant Sanskrit mathematics treatises after those of Bhaskara II, other than the Kerala school. He wrote the '' Ganita Kaumudi'' (lit "Moonlight of mathematics") in 1356 about mathematical operations. The work anticipated many developments in combinatorics. About his life, the most that is known is that: Narayana Pandit wrote two works, an arithmetical treatise called ''Ganita Kaumudi'' and an algebraic treatise called ''Bijaganita Vatamsa''. Narayanan is also thought to be the author of an elaborate commentary of Bhaskara II's Lilavati, titled ''Karmapradipika'' (or ''Karma-Paddhati''). Although the ''Karmapradipika'' contains little original work, it contains seven different methods for squaring numbers, a contribution that is wholly original to the author, as well as contributions to algebra and magic squares. Na ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Landau's Function
In mathematics, Landau's function ''g''(''n''), named after Edmund Landau, is defined for every natural number ''n'' to be the largest order of an element of the symmetric group ''S''''n''. Equivalently, ''g''(''n'') is the largest least common multiple (lcm) of any partition of ''n'', or the maximum number of times a permutation of ''n'' elements can be recursively applied to itself before it returns to its starting sequence. For instance, 5 = 2 + 3 and lcm(2,3) = 6. No other partition of 5 yields a bigger lcm, so ''g''(5) = 6. An element of order 6 in the group ''S''5 can be written in cycle notation as (1 2) (3 4 5). Note that the same argument applies to the number 6, that is, ''g''(6) = 6. There are arbitrarily long sequences of consecutive numbers ''n'', ''n'' + 1, …, ''n'' + ''m'' on which the function ''g'' is constant. The integer sequence ''g''(0) = 1, ''g''(1) = 1, ''g''(2) = 2, ''g''(3) = 3, ''g''(4) = 4, ''g''(5) = 6, ''g''(6) = 6 ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Ramanujan Tau Function
The Ramanujan tau function, studied by , is the function \tau : \mathbb \rarr\mathbb defined by the following identity: :\sum_\tau(n)q^n=q\prod_\left(1-q^n\right)^ = q\phi(q)^ = \eta(z)^=\Delta(z), where with , \phi is the Euler function, is the Dedekind eta function, and the function is a holomorphic cusp form of weight 12 and level 1, known as the discriminant modular form (some authors, notably Apostol, write \Delta/(2\pi)^ instead of \Delta). It appears in connection to an "error term" involved in counting the number of ways of expressing an integer as a sum of 24 squares. A formula due to Ian G. Macdonald was given in . Values The first few values of the tau function are given in the following table : Ramanujan's conjectures observed, but did not prove, the following three properties of : * if (meaning that is a multiplicative function) * for prime and . * for all primes . The first two properties were proved by and the third one, called the Ramanujan conjec ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Perfect Number
In number theory, a perfect number is a positive integer that is equal to the sum of its positive divisors, excluding the number itself. For instance, 6 has divisors 1, 2 and 3 (excluding itself), and 1 + 2 + 3 = 6, so 6 is a perfect number. The sum of divisors of a number, excluding the number itself, is called its aliquot sum, so a perfect number is one that is equal to its aliquot sum. Equivalently, a perfect number is a number that is half the sum of all of its positive divisors including itself; in symbols, \sigma_1(n)=2n where \sigma_1 is the sum-of-divisors function. For instance, 28 is perfect as 1 + 2 + 4 + 7 + 14 = 28. This definition is ancient, appearing as early as Euclid's ''Elements'' (VII.22) where it is called (''perfect'', ''ideal'', or ''complete number''). Euclid also proved a formation rule (IX.36) whereby q(q+1)/2 is an even perfect number whenever q is a prime of the form 2^p-1 for positive integer p—what is now called a Mersenne prime. Two millennia ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Polytree
In mathematics, and more specifically in graph theory, a polytree (also called directed tree, oriented tree; . or singly connected network.) is a directed acyclic graph whose underlying undirected graph is a tree. In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is both connected and acyclic. A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirected graph is a forest. In other words, if we replace its directed edges with undirected edges, we obtain an undirected graph that is acyclic. A polytree is an example of an oriented graph. The term ''polytree'' was coined in 1987 by Rebane and Pearl.. Related structures * An arborescence is a directed rooted tree, i.e. a directed acyclic graph in which there exists a single source node that has a unique path to every other node. Every arborescence is a polytree, but not every polytree is an arborescence. * A multitree is a dire ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Fermat Number
In mathematics, a Fermat number, named after Pierre de Fermat, who first studied them, is a positive integer of the form :F_ = 2^ + 1, where ''n'' is a non-negative integer. The first few Fermat numbers are: : 3, 5, 17, 257, 65537, 4294967297, 18446744073709551617, ... . If 2''k'' + 1 is prime and ''k'' > 0, then ''k'' must be a power of 2, so 2''k'' + 1 is a Fermat number; such primes are called Fermat primes. , the only known Fermat primes are ''F''0 = 3, ''F''1 = 5, ''F''2 = 17, ''F''3 = 257, and ''F''4 = 65537 ; heuristics suggest that there are no more. Basic properties The Fermat numbers satisfy the following recurrence relations: : F_ = (F_-1)^+1 : F_ = F_ \cdots F_ + 2 for ''n'' ≥ 1, : F_ = F_ + 2^F_ \cdots F_ : F_ = F_^2 - 2(F_-1)^2 for ''n'' ≥ 2. Each of these relations can be proved by mathematical induction. From the second equation, we can deduce Goldbach's theorem (named after Christian Goldbach): no two Fermat numbers share a common integer factor ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |