AI & ChatGPT searches , social queries for PADOVAN SEQUENCE
Search references for PADOVAN SEQUENCE. Phrases containing PADOVAN SEQUENCE
See searches and references containing PADOVAN SEQUENCE!
Search references for PADOVAN SEQUENCE. Phrases containing PADOVAN SEQUENCE
See searches and references containing PADOVAN SEQUENCE!PADOVAN SEQUENCE
Sequence of integers
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 , {\displaystyle
Padovan_sequence
Natural number
in the Padovan sequence. The fourth magic number in physics. "Sloane's A007770 : Happy numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation
28_(number)
Natural number
proper divisors, is greater than itself. The number appears in the Padovan sequence, preceded by 86, 114, and 151 (it is the sum of the first two of these)
200_(number)
Natural number
an aliquot sequence of seven members (86, 46, 26, 16, 15, 9, 4, 3, 1, 0) in the prime 3-aliquot tree. It appears in the Padovan sequence, preceded by
86_(number)
Number sequence 3,0,2,3,2,5,5,7,10,...
Perrin [fr], bear the same relationship to the Padovan sequence as the Lucas numbers do to the Fibonacci sequence. The Perrin numbers are defined by the recurrence
Perrin_number
Natural number
the equation φ(x) = 114, making 114 a nontotient. 114 appears in the Padovan sequence, preceded by the terms 49, 65, 86 (it is the sum of the first two of
114_(number)
Numbers obtained by adding the two previous ones
value x, the result is the sequence of Fibonacci polynomials. Not adding the immediately preceding numbers. The Padovan sequence and Perrin numbers have
Fibonacci_sequence
Natural number
being the square of 2 and 9 being the square of 3. It appears in the Padovan sequence, preceded by the terms 21, 28, 37 (it is the sum of the first two of
49_(number)
Mathematical sequences
Fibonacci polynomials are another generalization of Fibonacci numbers. The Padovan sequence is generated by the recurrence P ( n ) = P ( n − 2 ) + P ( n − 3
Generalizations of Fibonacci numbers
Generalizations_of_Fibonacci_numbers
Natural number
Integer Sequences. OEIS Foundation. Retrieved 2016-05-31. "Sloane's A000931: Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation
37_(number)
British architect (born 1935)
Padovan described the Padovan sequence of numbers 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, ... (sequence A000931
Richard_Padovan
Natural number
squares in two (or more) ways, 65 = 82 + 12 = 72 + 42. It appears in the Padovan sequence, preceded by the terms 28, 37, 49 (it is the sum of the first two of
65_(number)
Surname list
Padovan, Yugoslav water polo player Padovan sequence, integer sequence This page lists people with the surname Padovan. If an internal link intending to
Padovan
Natural number
7714 – square pyramidal number 7727 – safe prime 7739 – member of the Padovan sequence 7741 = number of trees with 15 unlabeled nodes 7744 = 882, square palindrome
7000_(number)
Natural number
of the papyrus 115 gives the number as 616. 616 is a member of the Padovan sequence, coming after 265, 351, 465 (it is the sum of the first two of these)
616_(number)
Natural number
cototient number, balanced prime, 600th prime number 4410 – member of the Padovan sequence 4411 – centered heptagonal number 4421 – super-prime, alternating factorial
4000_(number)
In mathematics, Padovan polynomials are a generalization of Padovan sequence numbers. These polynomials are defined by: P n ( x ) = { 1 , if n = 1 0
Padovan_polynomials
is a list of notable integer sequences with links to their entries in the On-Line Encyclopedia of Integer Sequences. OEIS core sequences Index to OEIS
List_of_integer_sequences
Natural number
5830 - sum of the first 53 primes 5832 = 183 5842 – member of the Padovan sequence 5849 – Sophie Germain prime 5869 – super-prime 5879 – safe prime, highly
5000_(number)
Natural number
centered decagonal number, and a lucky number. 151 appears in the Padovan sequence, preceded by the terms 65, 86, 114; it is the sum of the first two
151_(number)
Ordered list of whole numbers
Natural numbers Padovan numbers Partition numbers Perfect numbers Practical numbers Prime numbers Pseudoprime numbers Recamán's sequence Regular paperfolding
Integer_sequence
Natural number
is the 22nd Padovan number which is defined by the two equations P(0)=P(1)=P(2)=1 and P(n)=P(n-2)+P(n-3) similar to the Fibonacci sequence. 265 is the
265_(number)
Natural number
Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation
2000_(number)
Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation
1000_(number)
Natural number
Sophie Germain prime, Proth prime, member of the Padovan sequence 3354 – member of the Mian–Chowla sequence 3358 – sum of the squares of the first eleven
3000_(number)
Natural number
Retrieved 2016-05-31. "Sloane's A000931 : Padovan sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-31. "Sloane's
21_(number)
Shape with three equal sides
is unknown. Almost-equilateral Heronian triangle Malfatti circles Padovan sequence Ternary plot Trilinear coordinates Stahl (2003), p. 37. Lardner (1840)
Equilateral_triangle
Number, approximately 1.3247
London: European Architectural History Network. Plastic rectangle and Padovan sequence at Tartapelago by Giorgio Pietrocola. The digital study room of Dom
Plastic_ratio
Natural number
(ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A002407
10,000
Natural number
Foundation. Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. "A000217 - OEIS"
300_(number)
Natural number
Foundation. Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. "A000217 - OEIS"
400_(number)
Natural number
Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11. Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia
800_(number)
Unrelated vertices in graphs
of maximal independent sets in n-vertex path graphs is given by the Padovan sequence. Therefore, both numbers are proportional to powers of 1.324718...
Independent set (graph theory)
Independent_set_(graph_theory)
Recursive integer sequence
The Catalan numbers are a sequence of natural numbers that occur in various counting problems, often involving recursively defined objects. They are named
Catalan_number
Independent set which is not a subset of any other independent set
of maximal independent sets in n-vertex path graphs is given by the Padovan sequence. Therefore, both numbers are proportional to powers of 1.324718, the
Maximal_independent_set
consolidated theories. Integer sequence Fibonacci sequence Golden mean base Fibonacci coding Lucas sequence Padovan sequence Figurate numbers Polygonal number
List of recreational number theory topics
List_of_recreational_number_theory_topics
Infinite sequence of numbers satisfying a linear equation
needed] The sequences of Jacobsthal numbers, Padovan numbers, Pell numbers, and Perrin numbers are constant-recursive. The factorial sequence 1 , 1 , 2
Constant-recursive_sequence
Sequence of cuboids
In mathematics, the Padovan cuboid spiral is the spiral created by joining the diagonals of faces of successive cuboids added to a unit cube. The cuboids
Padovan_cuboid_spiral
Iterative algorithm on numbers
-\beta } to produce the next number of the sequence. Repeat step 2. The sequence is called a Kaprekar sequence and the function K b ( n ) = α − β {\displaystyle
Kaprekar's_routine
Number, approximately 1.46557
the age of three onwards. The Narayana sequence has a close connection to the Fibonacci and Padovan sequences and plays an important role in data coding
Supergolden_ratio
Mathematical sequence
integer sequence devised by and named after Stanisław Ulam, who introduced it in 1964. The standard Ulam sequence (the (1, 2)-Ulam sequence) starts with
Ulam_number
Number used to approximate the square root of 2
In mathematics, the Pell numbers are an infinite sequence of integers, known since ancient times, that comprise the denominators of the closest rational
Pell_number
Figurate number
The triangular numbers or triangle numbers are the sequence of positive integers that can be represented as a lattice of points arranged in an equilateral
Triangular_number
Integer having a non-trivial divisor
15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 36. (sequence A002808 in the OEIS) Every composite number can be written as the product
Composite_number
Infinite integer series where the next number is the sum of the two preceding it
Lucas sequence is an integer sequence named after the mathematician François Édouard Anatole Lucas (1842–1891), who studied both that sequence and the
Lucas_number
Ten raised to an integer power
ten are: 1, 10, 100, 1,000, 10,000, 100,000, 1,000,000, 10,000,000... (sequence A011557 in the OEIS) In decimal notation the nth power of ten is written
Power_of_10
Prime number of the form 2^n – 1
31, ... (sequence A000043 in the OEIS) and the resulting Mersenne primes are 3, 7, 31, 127, 8191, 131071, 524287, 2147483647, ... (sequence A000668 in
Mersenne_prime
Number equal to the sum of its proper divisors
function s(n) = σ(n) − n, and the aliquot sequence associated with a perfect number is a constant sequence. All perfect numbers are also S {\displaystyle
Perfect_number
Numbers with a certain property involving recursive summation
1^{2}+0^{2}=1} . On the other hand, 4 is not a happy number because the sequence starting with 4 2 = 16 {\displaystyle 4^{2}=16} and 1 2 + 6 2 = 37 {\displaystyle
Happy_number
Abundant number whose proper divisors are all deficient numbers
abundant numbers are: 20, 70, 88, 104, 272, 304, 368, 464, 550, 572 ... (sequence A071395 in the OEIS) The smallest odd primitive abundant number is 945
Primitive_abundant_number
Numbers in a type of Lucas sequence
integer sequence named after the German mathematician Ernst Jacobsthal. Like the related Fibonacci numbers, they are a specific type of Lucas sequence U n
Jacobsthal_number
Concept in combinatorics
lazy caterer's sequence. The values of Cn for n = 0, 1, 2, ... are given by 1, 2, 4, 8, 15, 26, 42, 64, 93, 130, 176, 232, ... (sequence A000125 in the
Cake_number
Class of binary number
These numbers give the positions of the zero values in the Thue–Morse sequence, and for this reason they have also been called the Thue–Morse set. Non-negative
Evil_number
Number that remains the same when its digits are reversed
131, 151, ... (sequence A002385 in the OEIS). The palindromic square numbers are 0, 1, 4, 9, 121, 484, 676, 10201, 12321, ... (sequence A002779 in the
Palindromic_number
Number used for counting
objects "larger", than the other. A sequence is a list of objects in a specific order. More precisely, a sequence is a function that assigns an object
Natural_number
Number that has a perfect number of factors adding up to another perfect number
numbers: 12 and (2126)(261 − 1)(231 − 1)(219 − 1)(27 − 1)(25 − 1)(23 − 1) (sequence A081357 in the OEIS). The second of these has 76 decimal digits: 6,086
Sublime_number
Two raised to an integer power
non-negative values of n are: 1, 2, 4, 8, 16, 32, 64, 128, 256, 512, ... (sequence A000079 in the OEIS) By comparison, powers of two with negative exponents
Power_of_two
Natural number
positive integers 23497 = cuban prime 23821 = square pyramidal number 23833 = Padovan prime 23969 = octahedral number 23976 = pentagonal pyramidal number 24000
20,000
Integers occurring in the coefficients of the Taylor series of 1/cosh t
In mathematics, the Euler numbers are a sequence En of integers (sequence A122045 in the OEIS) defined by the Taylor series expansion 1 cosh t = 2 e
Euler_numbers
Type of number introduced by Mike Keith
True sequence = [] y = x while y > 0: sequence.append(y % b) y = y // b digit_count = len(sequence) sequence.reverse() while sequence[len(sequence) - 1]
Keith_number
Numbers with many divisors
The first 41 highly composite numbers are listed in the table below (sequence A002182 in the OEIS). The number of divisors is given in the column labeled
Highly_composite_number
Result of multiplying five instances of a number together
number by its fourth power, or the square of a number by its cube. The sequence of fifth powers of integers is: 0, 1, 32, 243, 1024, 3125, 7776, 16807
Fifth_power_(algebra)
Result of multiplying four instances of a number together
zenzizenzic, biquadrate or supercubed instead of "to the power of 4". The sequence of fourth powers of integers, known as biquadrates or tesseractic numbers
Fourth_power
Pair of integers related by their divisors
10856), (12285, 14595), (17296, 18416), (63020, 76084), and (66928, 66992) (sequence A259180 in the OEIS). It is unknown if there are infinitely many pairs
Amicable_numbers
Sequence of rational numbers
In mathematics, a Göbel sequence is a sequence of rational numbers defined by the recurrence relation x n = x 0 2 + x 1 2 + ⋯ + x n − 1 2 n − 1 , {\displaystyle
Göbel's_sequence
Number that is less than the sum of its proper divisors
30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, and 96 (sequence A005101 in the OEIS). For example, the proper divisors of 24 are 1, 2,
Abundant_number
Concatenation of the first n prime numbers
1033, 2297, 3037, 11927, ... (sequence A046284 in the OEIS). The indices of the Smarandache–Wellin primes in the sequence of Smarandache–Wellin numbers
Smarandache–Wellin_number
Number n where the highest prime factor of (n^2 + 1) is at least 2n
85, 86, 87, 88, 89, 90, 92, 94, 95, 96, 97... (sequence A005528 in the OEIS). The complementary sequence (numbers below 100 that aren't Størmer) is only
Størmer_number
Result of multiplying eight instances of a number together
number by its seventh power, or the fourth power of a number by itself. The sequence of eighth powers of integers is: 0, 1, 256, 6561, 65536, 390625, 1679616
Eighth_power
Type of composite number with an even number of digits
124483, 125248, 125433, 125460, 125500, ... (sequence A014575 in the OEIS) There are many known sequences of infinitely many vampire numbers following
Vampire_number
Numbers whose aliquot sums form a cyclic sequence
form a periodic sequence. They are generalizations of the concepts of perfect numbers and amicable numbers. The first two sociable sequences, or sociable
Sociable_number
Number that represents a hexagon with a dot in the center
the associated hexagons share a vertex. The sequence of hexagonal numbers starts out as follows (sequence A003215 in the OEIS): 1, 7, 19, 37, 61, 91,
Centered_hexagonal_number
Number, approximately 1.618
doi:10.2140/pjm.1978.74.47. Le Corbusier, The Modulor, p. 25, as cited by Padovan (1999, p. 316) Frings, Marcus (2002). "The Golden Section in Architectural
Golden_ratio
Number in combinatorics
an integer sequence that can be used to count the plane trees with a given set of leaves, the ways of inserting parentheses into a sequence, and the ways
Schröder–Hipparchus_number
Type of Poulet number
and a super-Poulet number. The super-Poulet numbers below 10,000 are (sequence A050217 in the OEIS): It is relatively easy to get super-Poulet numbers
Super-Poulet_number
Integer having only small prime factors
the positive divisors of “the least common multiple of 1, 2, 3, …, n” (sequence A003418 in the OEIS), e.g. the 9-powersmooth numbers (also the 10-powersmooth
Smooth_number
Number equal to the sum of all or some of its divisors
first few semiperfect numbers are: 6, 12, 18, 20, 24, 28, 30, 36, 40, ... (sequence A005835 in the OEIS) Every multiple of a semiperfect number is semiperfect
Semiperfect_number
Number of unique ways to draw non-intersecting chords in a circle
1 , … {\displaystyle n=0,1,\dots } form the sequence: 1, 1, 2, 4, 9, 21, 51, 127, 323, 835, ... (sequence A001006 in the OEIS) The following figure shows
Motzkin_number
Integer filtered out using a sieve similar to that of Eratosthenes
Sloane, N. J. A. (ed.). "Sequence A031157 (Numbers that are both lucky and prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Guy,
Lucky_number
Count of the possible partitions of a set
203 , 877 , 4140 , … {\displaystyle 1,1,2,5,15,52,203,877,4140,\dots } (sequence A000110 in the OEIS). The Bell number B n {\displaystyle B_{n}} counts
Bell_number
Number that is the result of operation on its own digits
2502, 2503, 2504, 2505, 2506, 2507, 2508, 2509, 2592, 2737, 2916, ... (sequence A036057 in the OEIS). Friedman numbers are named after Erich Friedman,
Friedman_number
Numbers with special prime factorization
3528, 3872, 3888, 4000, 4232, 4500, 4563, 4608, 5000 (sequence A052486 in the OEIS). The sequence grows as O(n2/log log n), and the sum of reciprocals
Achilles_number
Class of natural numbers with many divisors
5040, 55440, 720720, 1441440, 4324320, 21621600, 367567200, 6983776800 (sequence A002201 in the OEIS) are also the first 15 colossally abundant numbers
Superior highly composite number
Superior_highly_composite_number
Integer named after Reo Fortune
37, 61, 67, 61, 71, 47, 107, 59, 61, 109, 89, 103, 79, 151, 197, ... (sequence A005235 in the OEIS). The Fortunate numbers sorted in numerical order with
Fortunate_number
Power of a prime number
powers, while 6 = 2 × 3, 12 = 22 × 3 and 36 = 62 = 22 × 32 are not. The sequence of prime powers begins: 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25
Prime_power
Type of positive integer
following property: there exists a positive integer a such that in the sequence (a, a + 1, …, a + k) of consecutive integers, each of the elements has
Erdős–Woods_number
Natural number
615 = 3 × 5 × 41. It is a sphenic number. 616 = 23 × 7 × 11. It is a Padovan number and a balanced number. 616 is an alternative value for the Number
600_(number)
Integer divisible by sum of its digits
harshad number many times over. So-called Trans-harshad numerals are sequences of the digits 0-9 which, in every base which uses all their digits, represent
Harshad_number
Mathematical concept
1952, only 6 lucky numbers of Euler exist, namely 2, 3, 5, 11, 17 and 41 (sequence A014556 in the OEIS). Note that these numbers are all prime numbers. The
Lucky_numbers_of_Euler
Number with odd number of 1s in binary
), "Sequence A000069 (Odious numbers: numbers with an odd number of 1's in their binary expansion)", The On-Line Encyclopedia of Integer Sequences, OEIS
Odious_number
Combinatorial sequence of numbers
In mathematics, the Dedekind numbers are a rapidly growing sequence of integers named after Richard Dedekind, who defined them in 1897. The Dedekind number
Dedekind_number
Integer where the average of its positive divisors is also an integer
and 2, and their average 3/2 is not an integer. The first numbers in the sequence of arithmetic numbers are 1, 3, 5, 6, 7, 11, 13, 14, 15, 17, 19, 20, 21
Arithmetic_number
Result of multiplying six instances of a number
number by its fourth power, by cubing a square, or by squaring a cube. The sequence of sixth powers of integers are: 0, 1, 64, 729, 4096, 15625, 46656, 117649
Sixth_power
Positive integer whose divisors have a harmonic mean that is an integer
numbers are 1, 6, 28, 140, 270, 496, 672, 1638, 2970, 6200, 8128, 8190 (sequence A001599 in the OEIS). Harmonic divisor numbers were introduced by Øystein
Harmonic_divisor_number
Integer that occurs often as a totient
576, 720, 1152, 1440 (sequence A097942 in the OEIS), with 2, 3, 4, 5, 6, 10, 11, 17, 21, 31, 34, 37, 38, 49, 54, and 72 (sequence A131934 in the OEIS)
Highly_totient_number
Positive integer of the form (2^(2^n))+1
4294967297, 18446744073709551617, 340282366920938463463374607431768211457, ... (sequence A000215 in the OEIS). If 2k + 1 is prime and k > 0, then k itself must
Fermat_number
Product of two prime numbers
51, 55, 57, 58, 62, 65, 69, 74, 77, 82, 85, 86, 87, 91, 93, 94, and 95 (sequence A001358 in the OEIS) Semiprimes that are not square numbers are called
Semiprime
Numbers that evenly divide powers of 60
45, 48, 50, 54, 60, ... (sequence A051037 in the OEIS) Several other sequences at the On-Line Encyclopedia of Integer Sequences have definitions involving
Regular_number
Number divisible only by 1 and itself
19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 (sequence A000040 in the OEIS). No even number n {\displaystyle n} greater than
Prime_number
Integer describing itself
Sloane, N. J. A. (ed.). "Sequence A108551 (Self-descriptive numbers in various bases)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Sloane
Self-descriptive_number
PADOVAN SEQUENCE
PADOVAN SEQUENCE
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Sanskrit, Tamil, Telugu
Purifier; Water; Air; Pure; Sacred; Breeze; Wind
Boy/Male
Bengali, Gujarati, Hindu, Indian, Malayalam, Tamil, Traditional
Another Name of Lord Krishna
Boy/Male
Gujarati, Hindu, Indian
Son of Anil; Pavan
Girl/Female
Indian
Daughter of Lord Pavan
Boy/Male
Hindu, Indian, Tamil
Lord Brahama; Buddha
Boy/Male
Biblical
His redemption; ox-yoke.
Boy/Male
Hindu
Intoxicating
Male
English
Anglicized form of Welsh Cadwgawn, CADOGAN means "battle glory."
Boy/Male
Indian
The Sun
Boy/Male
Hindu
Purifier
Boy/Male
Hungarian
from the Adriatic'.
Boy/Male
Gujarati, Hindu, Indian, Kannada, Tamil
Sun; Peack
Boy/Male
Hindu, Indian, Marathi
Mighty Superior
Boy/Male
Hindu
Full Moon
Boy/Male
Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Tamil, Telugu
Lotus
Boy/Male
Hindu, Indian, Malayalam
A Ceremony; Hight; Peak; Moonlight
Male
Serbian
(Радован) Serbian name derived from the Slavic word rad, RADOVAN means "happy."
Boy/Male
Hindu, Indian, Tamil
Sun
Boy/Male
Indian, Tamil
God of Flower
Boy/Male
Hindu
Wind
PADOVAN SEQUENCE
PADOVAN SEQUENCE
Male
English
Pledge
Girl/Female
Muslim
Powerful lady
Girl/Female
American, Australian, Biblical, British, Chinese, Christian, Danish, English, Finnish, French, German, Gothic, Italian, Latin, Portuguese, Swedish
Ancient; Primitive; Venerable
Boy/Male
Arabic, Indian, Muslim
Orator; Preacher
Girl/Female
Australian, Chinese, Christian, Danish, Finnish, French, German, Greek, Hebrew, Swiss
Daughter of the Sun; Jehovah is God
Boy/Male
Bengali, Hindu, Indian
Sun of Akash; Sun Lord of Light; Prakash; Sun
Girl/Female
Tamil
Water
Boy/Male
Anglo, British, English
Warrior
Girl/Female
American, Christian, English, Hawaiian, Hebrew, Indian, Swedish
The Ensnarer; One who Snares; Traps; Bound
Girl/Female
American, Australian
God is My Judge
PADOVAN SEQUENCE
PADOVAN SEQUENCE
PADOVAN SEQUENCE
PADOVAN SEQUENCE
PADOVAN SEQUENCE
n.
Any succession of chords (or harmonic phrase) rising or falling by the regular diatonic degrees in the same scale; a succession of similar harmonic steps.
n.
A hand of five cards in consecutive order as to value; a sequence. When they are of one suit, it is calles straight flush.
n.
See Pavan.
n.
That which follows as a result; a sequence.
n.
A sequence of three playing cards of the same suit. Tierce of ace, king, queen, is called tierce-major.
n.
See Pavan.
n.
A hymn introduced in the Mass on certain festival days, and recited or sung immediately before the gospel, and after the gradual or introit, whence the name.
n.
The state of being sequent; succession; order of following; arrangement.
n.
That which follows or succeeds as an effect; sequel; consequence; result.
n.
All five cards, of a hand, in consecutive order as to value, but not necessarily of the same suit; when of one suit, it is called a sequence flush.
n.
Three or more cards of the same suit in immediately consecutive order of value; as, ace, king, and queen; or knave, ten, nine, and eight.
n.
A stately and formal Spanish dance for which full state costume is worn; -- so called from the resemblance of its movements to those of the peacock.
n.
A melodic phrase or passage successively repeated one tone higher; a rosalia.
n.
See Pavan.
n.
The quality or state of succession in a series; sequence.
n.
Simple succession, or the coming after in time, without asserting or implying causative energy; as, the reactions of chemical agents may be conceived as merely invariable sequences.
superl.
Composed of cards which constitute a regular sequence, as the ace, king, queen, jack, and ten-spot; as, a straight hand; a straight flush.
a.
Having or observing logical sequence; logically consistent and rigorous; consecutive in development or transition of thought.
n.
A form of melody in which a phrase or passage is successively repeated, each time a step or half step higher; a melodic sequence.
n.
A number of things or events standing or succeeding in order, and connected by a like relation; sequence; order; course; a succession of things; as, a continuous series of calamitous events.