Sequences
392,541 sequences
- Expansion of e.g.f. exp((exp(x)-1)^2/2).A060311
Expansion of e.g.f. exp((exp(x)-1)^2/2).
- Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).A060312
Number of distinct ways to tile a 2 X n rectangle with dominoes (solutions are identified if they are rotations or reflections of each other).
- Number of homeomorphically irreducible rooted trees (also known as series-reduced rooted trees, or rooted trees without nodes of degree 2) on n labeled nodes.A060313
Number of homeomorphically irreducible rooted trees (also known as series-reduced rooted trees, or rooted trees without nodes of degree 2) on n labeled nodes.
- a(n) = n + next number > n beginning with same digit as n.A060314
a(n) = n + next number > n beginning with same digit as n.
- a(1)=1; a(n) is the smallest positive integer that cannot be obtained from the integers {0, 1, ..., n-1} using each number at most once and the operators +, -, *, /.A060315
a(1)=1; a(n) is the smallest positive integer that cannot be obtained from the integers {0, 1, ..., n-1} using each number at most once and the operators +, -, *, /.
- a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5 and the operators +, -, *, /, using each number only once.A060316
a(n) is the smallest natural number we cannot obtain from n, n+1, n+2, n+3, n+4, n+5 and the operators +, -, *, /, using each number only once.
- a(n) = n * next number greater than n with same first digit as n.A060317
a(n) = n * next number greater than n with same first digit as n.
- Exponent of highest power of 3 dividing the n-th odd Catalan number Catalan(2^n - 1).A060318
Exponent of highest power of 3 dividing the n-th odd Catalan number Catalan(2^n - 1).
- Smallest Fibonacci number with n distinct prime factors.A060319
Smallest Fibonacci number with n distinct prime factors.
- Index of smallest Fibonacci number with exactly n distinct prime factors.A060320
Index of smallest Fibonacci number with exactly n distinct prime factors.
- Erroneous version of A051694.A060321
Erroneous version of A051694.
- Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.A060322
Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.
- The first k digits of k! form a prime number.A060323
The first k digits of k! form a prime number.
- a(n) is the minimal prime q such that n*(q+1)-1 is prime, that is, the smallest prime q so that n = (p+1)/(q+1) with p prime; or a(n) = -1 if no such q exists.A060324
a(n) is the minimal prime q such that n*(q+1)-1 is prime, that is, the smallest prime q so that n = (p+1)/(q+1) with p prime; or a(n) = -1 if no such q exists.
- a(n) = n-th prime prime(n) subtracted from sum of all composites between prime(n) and prime(n-1).A060325
a(n) = n-th prime prime(n) subtracted from sum of all composites between prime(n) and prime(n-1).
- Numbers m such that 2*m - sigma(m) is a divisor of m and greater than one, where sigma = A000203 is the sum of divisors.A060326
Numbers m such that 2*m - sigma(m) is a divisor of m and greater than one, where sigma = A000203 is the sum of divisors.
- Primes the sum of both two and three consecutive composite numbers.A060327
Primes the sum of both two and three consecutive composite numbers.
- Primes which are the sum of three consecutive composite numbers.A060328
Primes which are the sum of three consecutive composite numbers.
- Primes the sum of four consecutive composite numbers.A060329
Primes the sum of four consecutive composite numbers.
- Primes that are the sum of five consecutive composite numbers.A060330
Primes that are the sum of five consecutive composite numbers.
- Primes the sum of six consecutive composite numbers.A060331
Primes the sum of six consecutive composite numbers.
- Primes the sum of seven consecutive composite numbers.A060332
Primes the sum of seven consecutive composite numbers.
- Primes which are the sum of eight consecutive composite numbers.A060333
Primes which are the sum of eight consecutive composite numbers.
- The sequence A006863 (shifted by one) seems to be counting the periodic points for a map. If so, then this is the sequence of the numbers of orbits of length n.A060334
The sequence A006863 (shifted by one) seems to be counting the periodic points for a map. If so, then this is the sequence of the numbers of orbits of length n.
- Number of n-node labeled acyclic digraphs with 3 out-points.A060335
Number of n-node labeled acyclic digraphs with 3 out-points.
- Number of n X n {-1,0,1} matrices modulo rows permutation (by symmetry this is the same as the number of {-1,0,1} matrices modulo columns permutation), i.e., the number of equivalence classes where two matrices A and B are equivalent if one of them is the result of permuting the rows of the other.A060336
Number of n X n {-1,0,1} matrices modulo rows permutation (by symmetry this is the same as the number of {-1,0,1} matrices modulo columns permutation), i.e., the number of equivalence classes where two matrices A and B are equivalent if one of them is the result of permuting the rows of the other.
- Number of labeled acyclic digraphs with n nodes containing exactly n-2 points of in-degree zero.A060337
Number of labeled acyclic digraphs with n nodes containing exactly n-2 points of in-degree zero.
- Triangle T(n,k) of coefficients of Meixner polynomials of degree n, k=0..n.A060338
Triangle T(n,k) of coefficients of Meixner polynomials of degree n, k=0..n.
- Primes that are each the sum of two, three, and four consecutive composite numbers.A060339
Primes that are each the sum of two, three, and four consecutive composite numbers.
- Possible sizes of the torsion group of an elliptic curve over some quadratic extension of the rationals Q. This is the full sequence.A060340
Possible sizes of the torsion group of an elliptic curve over some quadratic extension of the rationals Q. This is the full sequence.
- Non-adding primes: next term is smallest prime not the sum of any primes so far.A060341
Non-adding primes: next term is smallest prime not the sum of any primes so far.
- Smallest prime simultaneously the sum of two, three, ..., n consecutive composite numbers.A060342
Smallest prime simultaneously the sum of two, three, ..., n consecutive composite numbers.
- Smallest prime which is the sum of n composite numbers.A060343
Smallest prime which is the sum of n composite numbers.
- For n >= 2, let N_n denote the set of all unipotent upper-triangular real n X n matrices A such that for every k=1,2,...,n-1 the minor of A with rows 1,2,...,k and columns n-k+1,...,n is nonzero. a(n) is the number of connected components of N_n.A060344
For n >= 2, let N_n denote the set of all unipotent upper-triangular real n X n matrices A such that for every k=1,2,...,n-1 the minor of A with rows 1,2,...,k and columns n-k+1,...,n is nonzero. a(n) is the number of connected components of N_n.
- An expansion related to Yukawa coupling.A060345
An expansion related to Yukawa coupling.
- Numerators of sequence arising from study of Calabi-Yau manifolds.A060346
Numerators of sequence arising from study of Calabi-Yau manifolds.
- Denominators of sequence arising from study of Calabi-Yau manifolds.A060347
Denominators of sequence arising from study of Calabi-Yau manifolds.
- a(n) = n^n * (n^2 - 1)/24.A060348
a(n) = n^n * (n^2 - 1)/24.
- a(n) = n^(n+2)*(n^2 - 1)*(n+3)*(n+2)*(5*n - 7)/5760.A060349
a(n) = n^(n+2)*(n^2 - 1)*(n+3)*(n+2)*(5*n - 7)/5760.
- The sum over all subsets S of [n] of the squares of the number of permutations with descent set = S.A060350
The sum over all subsets S of [n] of the squares of the number of permutations with descent set = S.
- If the binary expansion of n has k bits, let S be the subset of [k-1] such that i is in S if the i-th bit of n is a 1 (with the first bit being the least significant bit); a(n) is the number of permutations of [k] with descent set S.A060351
If the binary expansion of n has k bits, let S be the subset of [k-1] such that i is in S if the i-th bit of n is a 1 (with the first bit being the least significant bit); a(n) is the number of permutations of [k] with descent set S.
- a(n) = n*3^n - 1.A060352
a(n) = n*3^n - 1.
- Primes of the form k*3^k - 1.A060353
Primes of the form k*3^k - 1.
- The n-th n-gonal number: a(n) = n*(n^2 - 3*n + 4)/2.A060354
The n-th n-gonal number: a(n) = n*(n^2 - 3*n + 4)/2.
- Numbers k such that k and k+1 are powerful numbers.A060355
Numbers k such that k and k+1 are powerful numbers.
- Expansion of e.g.f.: -LambertW(-x/(1+x)).A060356
Expansion of e.g.f.: -LambertW(-x/(1+x)).
- a(n) = smallest prime > lcm(1..n).A060357
a(n) = smallest prime > lcm(1..n).
- a(n) = largest prime < lcm(1..n).A060358
a(n) = largest prime < lcm(1..n).
- a(n) = (smallest prime > k) - (largest prime < k), where k = lcm(1..n).A060359
a(n) = (smallest prime > k) - (largest prime < k), where k = lcm(1..n).
- a(n) = k - (largest prime < k), where k = lcm(1..n).A060360
a(n) = k - (largest prime < k), where k = lcm(1..n).