Sequences
392,541 sequences
- Alternating row sums of array A078739 ((2,2)-Stirling2).A090211
Alternating row sums of array A078739 ((2,2)-Stirling2).
- Alternating row sums of array A078741 ((3,3)-Stirling2).A090212
Alternating row sums of array A078741 ((3,3)-Stirling2).
- Alternating row sums of array A090214 ((4,4)-Stirling2).A090213
Alternating row sums of array A090214 ((4,4)-Stirling2).
- Generalized Stirling2 array S_{4,4}(n,k).A090214
Generalized Stirling2 array S_{4,4}(n,k).
- A generalization of triangles A071951 (Legendre-Stirling) and A089504.A090215
A generalization of triangles A071951 (Legendre-Stirling) and A089504.
- Generalized Stirling2 array S_{5,5}(n,k).A090216
Generalized Stirling2 array S_{5,5}(n,k).
- A generalization of triangle A071951 (Legendre-Stirling).A090217
A generalization of triangle A071951 (Legendre-Stirling).
- Alternating row sums of array A090216 (generalized Stirling2 array S_{5,5}(n,m)).A090218
Alternating row sums of array A090216 (generalized Stirling2 array S_{5,5}(n,m)).
- Signed triangle used to compute column sequences of array A078741 ((3,3)-Stirling2).A090219
Signed triangle used to compute column sequences of array A078741 ((3,3)-Stirling2).
- Denominators used in A090219 to compute formula for column sequences of array A078741.A090220
Denominators used in A090219 to compute formula for column sequences of array A078741.
- Array used for numerators of g.f.s for column sequences of array A090214 ((4,4)-Stirling2).A090221
Array used for numerators of g.f.s for column sequences of array A090214 ((4,4)-Stirling2).
- Array used for numerators of g.f.s for column sequences of array A090216 ((5,5)-Stirling2).A090222
Array used for numerators of g.f.s for column sequences of array A090216 ((5,5)-Stirling2).
- Nonnegative integers with doubled multiples of 4.A090223
Nonnegative integers with doubled multiples of 4.
- Number of possible positions for n discs on a standard 7 X 6 board of Connect-Four.A090224
Number of possible positions for n discs on a standard 7 X 6 board of Connect-Four.
- T(n,k) = Points in n-dimensional lattice of side length k with at least one coordinate = k and GCD of all coordinates = 1.A090225
T(n,k) = Points in n-dimensional lattice of side length k with at least one coordinate = k and GCD of all coordinates = 1.
- Least k such that prime(k) has n digits. Index of least n-digit prime.A090226
Least k such that prime(k) has n digits. Index of least n-digit prime.
- Beginning with 11, the smallest prime not already used beginning with the number obtained by placing the most significant digit to the right of the least significant digit.A090227
Beginning with 11, the smallest prime not already used beginning with the number obtained by placing the most significant digit to the right of the least significant digit.
- Products of consecutive members of A090206 (nonprime Fibonacci numbers).A090228
Products of consecutive members of A090206 (nonprime Fibonacci numbers).
- Differences between consecutive nonprime Fibonacci numbers (A090206).A090229
Differences between consecutive nonprime Fibonacci numbers (A090206).
- Decimal positions where Pi, E and Phi are the same.A090230
Decimal positions where Pi, E and Phi are the same.
- Largest prime as a concatenation in decreasing order of primes starting with prime(n).A090231
Largest prime as a concatenation in decreasing order of primes starting with prime(n).
- Year in which n-th President of U.S.A. assumed office.A090232
Year in which n-th President of U.S.A. assumed office.
- Puzzle-Box primes (lids).A090233
Puzzle-Box primes (lids).
- Binomial transform gives a prime.A090234
Binomial transform gives a prime.
- Primes arising in A090234.A090235
Primes arising in A090234.
- Puzzle-Box primes (bases).A090236
Puzzle-Box primes (bases).
- Numerators of the partial sums of the reciprocals of the lower members of twin prime pairs.A090237
Numerators of the partial sums of the reciprocals of the lower members of twin prime pairs.
- Triangle T(n, k) read by rows. T(n, k) is the number of lists of k unlabeled permutations whose total length is n.A090238
Triangle T(n, k) read by rows. T(n, k) is the number of lists of k unlabeled permutations whose total length is n.
- a(n) = A053838(n) + 2 modulo 3.A090239
a(n) = A053838(n) + 2 modulo 3.
- Numbers which occur as the harmonic mean of the divisors of m for some m.A090240
Numbers which occur as the harmonic mean of the divisors of m for some m.
- a(n) = F(n)^F(n+1), where F is the Fibonacci sequence A000045.A090241
a(n) = F(n)^F(n+1), where F is the Fibonacci sequence A000045.
- a(n) = F(n)^F(n-1), where F is the Fibonacci sequence A000045.A090242
a(n) = F(n)^F(n-1), where F is the Fibonacci sequence A000045.
- Permutation of natural numbers generated by 4-rowed array shown below.A090243
Permutation of natural numbers generated by 4-rowed array shown below.
- a(0) = 1; a(1) = 2; a(n) = { a(n-1) + a(n-2) for n even, a(n-1) - a(n-2) for n odd }.A090244
a(0) = 1; a(1) = 2; a(n) = { a(n-1) + a(n-2) for n even, a(n-1) - a(n-2) for n odd }.
- Maximum numbers of cards that would have no SET in an n-attribute version of the SET card game.A090245
Maximum numbers of cards that would have no SET in an n-attribute version of the SET card game.
- The largest subset of P(Z/3Z)^n that does not contain 3 collinear points.A090246
The largest subset of P(Z/3Z)^n that does not contain 3 collinear points.
- a(n) = 26*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 26.A090247
a(n) = 26*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 26.
- a(n) = 27a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 27.A090248
a(n) = 27a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 27.
- a(n) = 28a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 28.A090249
a(n) = 28a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 28.
- Least multiple of n such that deleting the first r most significant digits yields a number divisible by n-r, for r = 0 to n-2.A090250
Least multiple of n such that deleting the first r most significant digits yields a number divisible by n-r, for r = 0 to n-2.
- a(n) =29a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 29.A090251
a(n) =29a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 29.
- The Two-Up sequence: a(n) is the least positive number not already used that is coprime to the previous floor(n/2) terms.A090252
The Two-Up sequence: a(n) is the least positive number not already used that is coprime to the previous floor(n/2) terms.
- a(1) = 2, a(2) = 3, a(n) = least prime greater than the product of two previous terms.A090253
a(1) = 2, a(2) = 3, a(n) = least prime greater than the product of two previous terms.
- a(1) =1, a(n) the least n-th power greater than the product of all previous terms.A090254
a(1) =1, a(n) the least n-th power greater than the product of all previous terms.
- A090254(n)^(1/n).A090255
A090254(n)^(1/n).
- Beginning with 1, least number greater than the product of all previous terms having n divisors.A090256
Beginning with 1, least number greater than the product of all previous terms having n divisors.
- a(1) = 1, then least square such that every partial concatenation is a prime.A090257
a(1) = 1, then least square such that every partial concatenation is a prime.
- Last term of prime quadruples.A090258
Last term of prime quadruples.
- Least even a(n) > 2 not representable as a sum of two of the first n primes. From Goldbach conjecture.A090259
Least even a(n) > 2 not representable as a sum of two of the first n primes. From Goldbach conjecture.
- Beginning with 1, distinct numbers such that concatenation a(n+1), a(n), a(n+1) is a prime.A090260
Beginning with 1, distinct numbers such that concatenation a(n+1), a(n), a(n+1) is a prime.