Search references for ARONSONS SEQUENCE. Phrases containing ARONSONS SEQUENCE
See searches and references containing ARONSONS SEQUENCE!ARONSONS SEQUENCE
Sequence of numbers
Aronson's sequence is an integer sequence defined by the English sentence "T is the first, fourth, eleventh, sixteenth, ... letter in this sentence."
Aronson's_sequence
Numbers obtained by adding the two previous ones
Fibonacci sequence is a sequence in which each element is the sum of the two elements that precede it. Numbers that are part of the Fibonacci sequence are known
Fibonacci_sequence
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
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
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
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
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
Natural number
number, a rhombic matchstick number, a happy number, and a member of Aronson's sequence. There are exactly 208 five-bead necklaces drawn from a set of beads
208_(number)
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
Type of composite integer
706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985. (sequence A006753 in the OEIS) W.L. McDaniel in 1987 proved that there are infinitely
Smith_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
Mathematical concept
40. 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
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
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
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
Product of an integer with itself
\lfloor x\rfloor } represents the floor of the number x. The squares (sequence A000290 in the OEIS) smaller than 602 = 3600 are: 02 = 0 12 = 1 22 = 4
Square_number
Number that cannot be written as an aliquot sum
324, 326, 336, 342, 372, 406, 408, 426, 430, 448, 472, 474, 498, ... (sequence A005114 in the OEIS). Unsolved problem in mathematics Are there any odd
Untouchable_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
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
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
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
Number that is less than the sum of its proper divisors
24, 30, 36, 40, 42, 48, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, 96 (sequence A005101 in the OEIS). For example, the proper divisors of 24 are 1, 2,
Abundant_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
Natural number
and preceding 238. 237 is a lucky number, and one of the numbers in Aronson's sequence. The 237th square pyramidal number, 4465475, is also a sum of two
237_(number)
Integer whose multiples are digit rotations
necessary structure given in the next section. Allowing leading zeros, the sequence of cyclic numbers begins: (106 − 1) / 7 = 142857 (6 digits) (1016 − 1)
Cyclic_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
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
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
Numbers k where x - phi(x) = k has many solutions
509, 629, 659, 779, 839, 1049, 1169, 1259, 1469, 1649, 1679, 1889, ... (sequence A100827 in the OEIS) Many of the highly cototient numbers are odd. The
Highly_cototient_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
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
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 whose representation contains every digit in its number base
pandigital number in base 10. The first few pandigital base 10 numbers are (sequence A171102 in the OEIS): 1023456789, 1023456798, 1023456879, 1023456897, 1023456978
Pandigital_number
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
Odd number with specific properties
n − 1 {\displaystyle k\times 2^{n}-1} , then k is a Riesel number. The sequence of currently known Sierpiński numbers begins with: 78557, 271129, 271577
Sierpiński_number
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
Three raised to an integer power
powers of three are: 1, 3, 9, 27, 81, 243, 729, 2187, 6561, 19683, etc. (sequence A000244 in OEIS) The powers of three give the place values in the ternary
Power_of_three
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
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
Centered figurate number
11353, and 11881. (sequence A003154 in the OEIS) The digital root of a star number is always 1 or 4, and progresses in the sequence 1, 4, 1. The last two
Star_number
Sum of a number's digits
Encyclopedia of Integer Sequences. Borwein & Borwein (1992) use the generating function of this integer sequence (and of the analogous sequence for binary digit
Digit_sum
Natural number
of Aronson's sequence. At most 226 different permutation patterns can occur within a single 9-element permutation. Sloane, N. J. A. (ed.). "Sequence A007770
226_(number)
Type of figurate number
h_{n}=2n^{2}-n=n(2n-1)={\frac {2n(2n-1)}{2}}.} The first few hexagonal numbers (sequence A000384 in the OEIS) are: 1, 6, 15, 28, 45, 66, 91, 120, 153, 190, 231
Hexagonal_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
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
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
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
Numbers whose sum of divisors is twice the number plus 1
5^{2}\times 13} . They are 20, 104, 464, 650, 1952, 130304, 522752, ... (sequence A088831 in the OEIS). Numbers n whose sum of factors equals 2 n − 2 {\displaystyle
Quasiperfect_number
Numbers that contain only the digit 1
in base 10 representation. The sequence of repunits base-10 starts with 1, 11, 111, 1111, 11111, 111111, ... (sequence A002275 in the OEIS). Similarly
Repunit
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
Number of form 2^(2^p-1)-1 with prime exponent
{\displaystyle p} is prime. The first four terms of the sequence of double Mersenne numbers are (sequence A077586 in the OEIS): M M 2 = M 3 = 7 {\displaystyle
Double_Mersenne_number
Number, non-palindrome after repeated sum with reverse
a sequence of the first 126 numbers (125 of them never reported before) that take exactly 261 steps to reach a 119-digit palindrome. This sequence was
Lychrel_number
Number with a half-integer abundancy index
4320, 4680, 26208, 8910720, 17428320, 20427264, 91963648, 197064960, ... (sequence A159907 in the OEIS) 24 is a hemiperfect number because the sum of the
Hemiperfect_number
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
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
Numbers with special prime factorization
3200, 3267, 3456, 3528, 3872, 3888, 4000, 4232, 4500, 4563, 4608, 5000 (sequence A052486 in the OEIS). The smallest pair of consecutive Achilles numbers
Achilles_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
Type of natural number
5040, 55440, 720720, 1441440, 4324320, 21621600, 367567200, 6983776800 (sequence A004490 in the OEIS) are also the first 15 superior highly composite numbers
Colossally_abundant_number
Number that is more than the sum of its proper divisors
31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 50, ... (sequence A005100 in the OEIS) As an example, consider the number 21. Its proper
Deficient_number
Mathematical concept
In mathematics, a Cullen number is a member of the integer sequence C n = n ⋅ 2 n + 1 {\displaystyle C_{n}=n\cdot 2^{n}+1} (where n {\displaystyle n} is
Cullen_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 that has fewer digits than the number of digits in its prime factorization
base 10, 4 = 22, 6 = 2×3, 8 = 23, and 9 = 32 are extravagant numbers (sequence A046760 in the OEIS). There are infinitely many extravagant numbers in
Extravagant_number
Type of positive composite integer
X^{K/\left(\log \log \log X\right)^{2}}} . The first few Lucas–Carmichael numbers (sequence A006972 in the OEIS) and their prime factors are listed below. Thomas Wright
Lucas–Carmichael_number
Class of natural numbers
few superabundant numbers are 1, 2, 4, 6, 12, 24, 36, 48, 60, 120, ... (sequence A004394 in the OEIS). For example, the number 5 is not a superabundant
Superabundant_number
Composite number in number theory
seen with Korselt's criterion. The first seven Carmichael numbers are (sequence A002997 in the OEIS): 561 = 3 ⋅ 11 ⋅ 17 ( 2 ∣ 560 ; 10 ∣ 560
Carmichael_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
Size of a geometric arrangement of points
Prime Sorting related Pancake number Sorting number Natural language related Aronson's sequence Ban Graphemics related Strobogrammatic Mathematics portal
Figurate_number
Numbers parameterizing ways to partition a set
triangular array of values for the Stirling numbers of the second kind (sequence A048993 in the OEIS): As with the binomial coefficients, this table could
Stirling numbers of the second kind
Stirling_numbers_of_the_second_kind
Mathematical sequences in combinatorics
three kinds is that they describe coefficients relating three different sequences of polynomials that frequently arise in combinatorics. Moreover, all three
Stirling_number
Number of the form (n * 2^n) - 1
n. The first few Woodall numbers are: 1, 7, 23, 63, 159, 383, 895, … (sequence A003261 in the OEIS). Woodall numbers were first studied by Allan J. C
Woodall_number
Number, product of consecutive integers
2550, 2652, 2756, 2862, 2970, 3080, 3192, 3306, 3422, 3540, 3660... (sequence A002378 in the OEIS). Letting P n {\displaystyle P_{n}} denote the pronic
Pronic_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 sequence 3,0,2,3,2,5,5,7,10,...
mathematics, the Perrin numbers are a doubly infinite constant-recursive integer sequence with characteristic equation x3 = x + 1. The Perrin numbers, named after
Perrin_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 seven instances of a number
number by its fifth power, or the cube of a number by its fourth power. The sequence of seventh powers of integers is: 0, 1, 128, 2187, 16384, 78125, 279936
Seventh_power
Polyhedral number representing a tetrahedron
tetrahedral numbers are: 1, 4, 10, 20, 35, 56, 84, 120, 165, 220, ... (sequence A000292 in the OEIS) The formula for the nth tetrahedral number is represented
Tetrahedral_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
Number raised to the third power
the cube of an integer. The non-negative perfect cubes up to 603 are (sequence A000578 in the OEIS): Geometrically speaking, a positive integer m is a
Cube_(algebra)
Type of number
(sequence A054377 in the OEIS). The first four of these numbers are one less than the corresponding numbers in Sylvester's sequence, but then
Primary_pseudoperfect_number
Number of dots in a centred dot square
2665, 2813, 2965, 3121, 3281, 3445, 3613, 3785, 3961, 4141, 4325, … (sequence A001844 in the OEIS). Each centered square number is the sum of successive
Centered_square_number
Numeral ambigram
6969, 8008, 8118, 8698, 8888, 8968, 9006, 9116, 9696, 9886, 9966, … (sequence A000787 in the OEIS) The first few strobogrammatic primes are: 11, 101
Strobogrammatic_number
Triangular array of natural numbers
k}{n \choose k-1}} The first eight rows of the Narayana triangle read: (sequence A001263 in the OEIS) An example of a counting problem whose solution can
Narayana_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
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
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
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
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
Probable prime that is composite
Prime Sorting related Pancake number Sorting number Natural language related Aronson's sequence Ban Graphemics related Strobogrammatic Mathematics portal
Pseudoprime
Number with few prime factors
Prime Sorting related Pancake number Sorting number Natural language related Aronson's sequence Ban Graphemics related Strobogrammatic Mathematics portal
Almost_prime
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
Number that when multiplied by another number moves its last digit to its front
numbers posed by Freeman Dyson. They are: (leading zeros are not allowed) (sequence A092697 in the OEIS) In general, if we relax the rules to allow a leading
Parasitic_number
Square of a triangular number
visual proof. The sequence of squared triangular numbers is 0, 1, 9, 36, 100, 225, 441, 784, 1296, 2025, 3025, 4356, 6084, 8281, ... (sequence A000537 in the
Squared_triangular_number
Number of close-packed spheres in an octahedron
octahedral numbers are: 1, 6, 19, 44, 85, 146, 231, 344, 489, 670, 891 (sequence A005900 in the OEIS). The octahedral numbers have a generating function
Octahedral_number
Composite number which passes Miller–Rabin primality test
53971, 79381, ... (sequence A020231 in the OEIS). For base 4, see (sequence A020230 in the OEIS), and for bases 6 to 100, see (sequence A020232 in the OEIS)
Strong_pseudoprime
Centered figurate number that represents a decagon with a dot in the center
31, 61, 101, 151, 211, 281, 361, 451, 551, 661, 781, 911, 1051, ... (sequence A062786 in the OEIS) Like any other centered k-gonal number, the nth centered
Centered_decagonal_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
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
Figurate number
given above, but with n taking values in the sequence 0, 1, −1, 2, −2, 3, −3, 4..., producing the sequence: 0, 1, 2, 5, 7, 12, 15, 22, 26, 35, 40, 51,
Pentagonal_number
Number equal to the product of the sum and product of its digits
{\displaystyle b} . In base 10, there are exactly four sum-product numbers (sequence A038369 in the OEIS): 0, 1, 135, and 144. Let n {\displaystyle n} be a
Sum-product_number
ARONSONS SEQUENCE
ARONSONS SEQUENCE
Boy/Male
Indian, Sanskrit
Order; Sequence
Boy/Male
Hebrew
Lofty; exalted; high mountain.
Surname or Lastname
English
English : variant of Brunson.
Boy/Male
American, Australian, British, English
Son of Ronald
Boy/Male
English American Anglo Saxon German
Son of a dark man.
Surname or Lastname
English
English : variant of Brunson.John Brownson or Bronson was one of the original settlers of Hartford, CT, in 1635.
Boy/Male
British, English
Son of a Dark Man
Surname or Lastname
English
English : patronymic from a reduced form of Rowland.
Boy/Male
Indian, Malayalam
Son of Sun
Surname or Lastname
English
English : ostensibly a topographic name containing Middle English cott, cote ‘cottage’ (see Coates). In fact, however, it is generally if not always an alteration of Alcock, in part at least for euphemistic reasons.Louisa May Alcott (1832–88), author of Little Women (1869), was the daughter of Amos Bronson Alcott (1799–1888), who had changed the family name from Alcox. The family trace their descent from an Alcocke family who emigrated from England to MA with John Winthrop in 1629.
Surname or Lastname
English
English : from a medieval male personal name (from Latin Hilarius, a derivative of hilaris ‘cheerful’, ‘glad’, from Greek hilaros ‘propitious’, ‘joyful’). The Latin name was chosen by many early Christians to express their joy and hope of salvation, and was borne by several saints, including a 4th-century bishop of Poitiers noted for his vigorous resistance to the Arian heresy, and a 5th-century bishop of Arles. Largely due to veneration of the first of these, the name became popular in France in the forms Hilari and Hilaire, and was brought to England by the Norman conquerors.English : from the much rarer female personal name Eulalie (from Latin Eulalia, from Greek eulalos ‘eloquent’, literally well-speaking, chosen by early Christians as a reference to the gift of tongues), likewise introduced into England by the Normans. A St. Eulalia was crucified at Barcelona in the reign of the Emperor Diocletian and became the patron of that city. In England the name underwent dissimilation of the sequence -l-l- to -l-r- and the unfamiliar initial vowel was also mutilated, so that eventually the name was considered as no more than a feminine form of Hilary (of which the initial aspirate was in any case variable).
Boy/Male
Indian, Sikh
Music; In-sequence
Surname or Lastname
English
English : nickname for a short, fat man, from Middle English, Old French tronchon ‘piece broken off’ (Late Latin truncio, genitive truncionis, from truncus ‘lopped’, ‘cut short’). It is just possible that the nickname also denoted someone who carried a staff or cudgel as a symbol of office, but this sense of the word is not attested in English before the 16th century.French : from Old French tronson ‘block of wood’, perhaps a metonymic occupational name for a woodcutter.
Girl/Female
Bengali, Gujarati, Hindu, Indian, Kannada, Malayalam, Marathi, Sanskrit, Telugu
Sequence
Boy/Male
English American
Man (from the Old English 'ceorl'). Famous Bearers: American movie star Charles Bronson;...
Boy/Male
American, Anglo, Australian, British, Chinese, English, German, Indian
Brown's Son; Son of the Dark-skinned One
Girl/Female
Tamil
Anuloma | அநà¯à®²à¯‹à®®à®¾
Sequence
ARONSONS SEQUENCE
ARONSONS SEQUENCE
Surname or Lastname
Norwegian
Norwegian : habitational name from any of several farmsteads in southwestern Norway, named with Old Norse lón ‘calm, deep pool (in a river)’.English : variant of Lane.Muslim : unexplained.
Girl/Female
Irish
Girl.
Boy/Male
Indian, Tamil
Handsome
Girl/Female
Indian
Illusion
Boy/Male
Hindu
Weapon, Kind and helpful
Boy/Male
English Irish American
Broad hillside.
Girl/Female
Tamil
Together, Conversation with God, Honored
Boy/Male
Indian, Tamil
Land God
Boy/Male
Arabic
Scholar
Girl/Female
Muslim
Beautiful butterfly
ARONSONS SEQUENCE
ARONSONS SEQUENCE
ARONSONS SEQUENCE
ARONSONS SEQUENCE
ARONSONS SEQUENCE
a.
Advancing with haste or speed; speedy in progression; in quick sequence; as, rapid growth; rapid improvement; rapid recurrence; rapid succession.
n.
In evolution, a deviation from the typical sequence in the formation of organs or parts.
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.
That which follows or succeeds as an effect; sequel; consequence; result.
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.
a.
Having or observing logical sequence; logically consistent and rigorous; consecutive in development or transition of thought.
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.
n.
The state of being sequent; succession; order of following; arrangement.
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.
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.
n.
The act of succeeding, or following after; a following of things in order of time or place, or a series of things so following; sequence; as, a succession of good crops; a succession of disasters.
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.
A melodic phrase or passage successively repeated one tone higher; a rosalia.
n.
That which follows as a result; a sequence.
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 sequence of three playing cards of the same suit. Tierce of ace, king, queen, is called tierce-major.
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.
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.
The doctrine of philosophical necessity; the doctrine that results follow by invariable sequence from causes, and esp. that the will is not free, but that human actions and choices result inevitably from motives; deteminism.