language:
Find link is a tool written by Edward Betts.searching for Integer sequence 42 found (116 total)
alternate case: integer sequence
Orchard-planting problem
(814 words)
[view diff]
no match in snippet
view article
find links to article
In discrete geometry, the original orchard-planting problem (or the tree-planting problem) asks for the maximum number of 3-point lines attainable by aWythoff array (761 words) [view diff] exact match in snippet view article find links to article
Every positive integer occurs exactly once in the array, and every integer sequence defined by the Fibonacci recurrence can be derived by shifting a rowFibonacci prime (2,331 words) [view diff] exact match in snippet view article find links to article
A Fibonacci prime is a Fibonacci number that is prime, a type of integer sequence prime. The first Fibonacci primes are (sequence A005478 in the OEIS):Singleton (mathematics) (828 words) [view diff] exact match in snippet view article
{\displaystyle X} of is an ultranet in X . {\displaystyle X.} The Bell number integer sequence counts the number of partitions of a set (OEIS: A000110), if singletonsSmarandache–Wellin number (334 words) [view diff] case mismatch in snippet view article find links to article
2357111317...27". factordb.com. Retrieved 2025-05-16. Weisstein, Eric W. "Integer Sequence Primes". MathWorld. Retrieved 2011-07-28. Weisstein, Eric W. "Smarandache–WellinCuban prime (457 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichNecklace ring (268 words) [view diff] exact match in snippet view article find links to article
series written in "necklace coordinates": that is, identifying an integer sequence ( a 1 , a 2 , . . . ) {\displaystyle (a_{1},a_{2},...)} with the powerWagstaff prime (870 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichWolstenholme prime (1,159 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichKepler–Bouwkamp constant (316 words) [view diff] case mismatch in snippet view article find links to article
(2014). "Kepler-Bouwkamp radius of combinatorial sequences". Journal of Integer Sequence. 17: 14.11.3. Weisstein, Eric W. "Polygon Inscribing". MathWorld.Pythagorean prime (1,092 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichSolinas prime (783 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichWilson prime (1,096 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichSimplicial complex (1,992 words) [view diff] exact match in snippet view article find links to article
often study the f-vector of a simplicial d-complex Δ, which is the integer sequence ( f 0 , f 1 , f 2 , … , f d + 1 ) {\displaystyle (f_{0},f_{1},f_{2}Ulam–Warburton automaton (1,507 words) [view diff] exact match in snippet view article find links to article
is OEIS sequence A130665) Then the total number of ON cells in the integer sequence n m {\displaystyle n_{m}} is given by U m ( n m ) = a m m 2 4 3 n m800 (number) (3,911 words) [view diff] no match in snippet view article
number, the Mertens function of 812 returns 0 813 = 3 × 271, Blum integer (sequence A016105 in the OEIS) 814 = 2 × 11 × 37, sphenic number, the MertensLaw of truly large numbers (1,201 words) [view diff] exact match in snippet view article find links to article
skepdic.com on the Law of Truly Large Numbers on the Law of Truly Large Numbers The On-Line Encyclopedia of Integer Sequences – related integer sequenceJoe Faust (athlete) (1,213 words) [view diff] exact match in snippet view article
a middle school. He was published in 2002 for authoring a specific integer sequence A066526. Joe Faust founded Kite Information and Technology ExchangePierpont prime (1,457 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichORVYL and WYLBUR (4,549 words) [view diff] exact match in snippet view article find links to article
user to export to native OS files with integer sequence numbers and to import native OS files with integer sequence and rescale the line number by a factorNatural density (1,762 words) [view diff] exact match in snippet view article find links to article
densities are defined analogously as well. For the set of multiples of an integer sequence, the Davenport–Erdős theorem states that the natural density, when15 puzzle (2,072 words) [view diff] exact match in snippet view article find links to article
solved in no more than 31 single-tile moves or 24 multi-tile moves (integer sequence A087725). The multi-tile metric counts subsequent moves of the emptyMetastaseis (Xenakis) (1,183 words) [view diff] exact match in snippet view article
row is used, with durations based on the Fibonacci sequence. (This integer sequence is nothing new to music: it was used often by Bartók, among othersGolden ratio base (2,016 words) [view diff] exact match in snippet view article find links to article
Fibonacci integer sequences. The sum of numbers in a General Fibonacci integer sequence that correspond with the nonzero digits in the base-φ number, is theDiophantine equation (4,809 words) [view diff] exact match in snippet view article find links to article
and so on?" The number of ways this can be done for each n forms an integer sequence. Infinite Diophantine equations are related to theta functions andScreen Memories (album) (2,962 words) [view diff] exact match in snippet view article
of chants. I messed around with a simple process where you take an integer sequence and let the numbers one-through-six designate the scale degree of aInterpolation sort (2,372 words) [view diff] exact match in snippet view article find links to article
maintaining N bit tags; however, the array to be sorted must be a continuous integer sequence and not repeated, or the series is completely evenly distributed toGolden-section search (2,600 words) [view diff] exact match in snippet view article find links to article
approximate the probe positions of golden section search while probing only integer sequence indices, the variant of the algorithm for this case typically maintainsGaussian integer (4,835 words) [view diff] no match in snippet view article find links to article
modulo 4 (that is, it may be written 4n + 3, with n a nonnegative integer) (sequence A002145 in the OEIS). The other prime numbers are not Gaussian primesWaring's problem (3,102 words) [view diff] exact match in snippet view article find links to article
68578904422 is the last known number that requires 9 fifth powers (Integer sequence S001057, Tony D. Noe, Jul 04 2017), 617597724 is the last number lessQuasisymmetric function (2,178 words) [view diff] exact match in snippet view article find links to article
i_{1}<i_{2}<\cdots <i_{k}} indexing the variables and any positive integer sequence ( α 1 , α 2 , … , α k ) {\displaystyle (\alpha _{1},\alpha _{2},\ldotsC++14 (2,438 words) [view diff] no match in snippet view article find links to article
operator() overload to return the constant value. The class template std::integer_sequence and related alias templates were added for representing compile-timeNome (mathematics) (13,966 words) [view diff] exact match in snippet view article
to the integer sequence of the series of the elliptic nome directly. The German mathematician Adolf Kneser researched on the integer sequence of the ellipticNumbers season 2 (708 words) [view diff] case mismatch in snippet view article find links to article
functions, geometric progression and exponential growth. Neil Sloane's Integer Sequence Database was also used. 36 23 "Undercurrents" J. Miller Tobin J. DavidAngelo Dalli (1,456 words) [view diff] exact match in snippet view article find links to article
the field of Bioinformatics Dalli has found a particularly useful integer sequence (sequence A062208 in the OEIS) which efficiently computes all alignmentsList of Martin Gardner Mathematical Games columns (355 words) [view diff] exact match in snippet view article find links to article
everything there was, is and ever will be 1976 Jun Catalan numbers: an integer sequence that materializes in unexpected places 1976 Jul Fun and serious businessLeech lattice (4,304 words) [view diff] exact match in snippet view article find links to article
{1_{n}}} is a ones vector of size n), G - 24-bit Golay code B - Binary integer sequence C - Thue-Morse Sequence or integer bit parity sum (that give chiralityLarge numbers (7,418 words) [view diff] exact match in snippet view article find links to article
10\uparrow \uparrow 65533} , see table. Given a strictly increasing integer sequence/function f 0 ( n ) {\displaystyle f_{0}(n)} (n≥1), it is possible toPetr–Douglas–Neumann theorem (1,601 words) [view diff] exact match in snippet view article find links to article
primitive root of unity and σj is the jth term of a permutation σ of the integer sequence (1,..., n-2). The last polygon in the sequence, An−2, which we needWieferich prime (6,975 words) [view diff] exact match in snippet view article find links to article
(xy + yx) Thabit (3·2n − 1) Williams ((b−1)·bn − 1) Mills (⌊A3n⌋) By integer sequence Fibonacci Lucas Pell Newman–Shanks–Williams Perrin By property WieferichLogistic map (18,835 words) [view diff] exact match in snippet view article find links to article
… for the logistic map with r = 4 (tent map with μ = 2) is a known integer sequence (sequence A001037 in the OEIS): 2, 1, 2, 3, 6, 9, 18, 30, 56, 99, 186Gbcast (9,697 words) [view diff] exact match in snippet view article find links to article
members of the most current view, identifying each by means of an integer sequence number. The sequence numbers reset to 1 as each new view is defined