Sequences
392,541 sequences
- A binomial transform of factorial numbers.A084261
A binomial transform of factorial numbers.
- Binomial transform of double factorials.A084262
Binomial transform of double factorials.
- a(n) = (-1)^n/2+(n^2+n+1)/2.A084263
a(n) = (-1)^n/2+(n^2+n+1)/2.
- Binomial transform of A084263.A084264
Binomial transform of A084263.
- a(n) = (n^2 + 3*n + 1 + (-1)^n) / 2.A084265
a(n) = (n^2 + 3*n + 1 + (-1)^n) / 2.
- Binomial transform of A084265.A084266
Binomial transform of A084265.
- Partial sums of a binomial quotient.A084267
Partial sums of a binomial quotient.
- Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.A084268
Triangle read by rows: T(n,k) is the number of simple graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.
- Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.A084269
Triangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes having chromatic number k, 1 <= k <= n.
- Number of labeled 2-chromatic (i.e., chromatic number = 2) graphs on n nodes.A084270
Number of labeled 2-chromatic (i.e., chromatic number = 2) graphs on n nodes.
- Number of labeled 3-chromatic (i.e., chromatic number = 3) graphs on n nodes.A084271
Number of labeled 3-chromatic (i.e., chromatic number = 3) graphs on n nodes.
- Number of labeled 4-chromatic (i.e., chromatic number = 4) graphs on n nodes.A084272
Number of labeled 4-chromatic (i.e., chromatic number = 4) graphs on n nodes.
- Number of labeled connected 3-chromatic (i.e., chromatic number = 3) graphs on n nodes.A084273
Number of labeled connected 3-chromatic (i.e., chromatic number = 3) graphs on n nodes.
- Number of labeled connected 4-chromatic (i.e., chromatic number = 4) graphs on n nodes.A084274
Number of labeled connected 4-chromatic (i.e., chromatic number = 4) graphs on n nodes.
- Pseudo-random numbers: MS C 6.0 version.A084275
Pseudo-random numbers: MS C 6.0 version.
- Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.A084276
Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.
- Pseudo-random numbers: Davenport's generator for 32-bit integers.A084277
Pseudo-random numbers: Davenport's generator for 32-bit integers.
- Squarefree numbers n which are the product of an even number of distinct primes such that Fibonacci(n) is also squarefree and the product of an even number of distinct primes.A084278
Squarefree numbers n which are the product of an even number of distinct primes such that Fibonacci(n) is also squarefree and the product of an even number of distinct primes.
- Number of labeled 3-colorable (i.e., chromatic number <= 3) graphs on n nodes.A084279
Number of labeled 3-colorable (i.e., chromatic number <= 3) graphs on n nodes.
- Number of labeled 4-colorable (i.e., chromatic number <= 4) graphs on n nodes.A084280
Number of labeled 4-colorable (i.e., chromatic number <= 4) graphs on n nodes.
- Number of labeled 5-colorable (i.e., chromatic number <= 5) graphs on n nodes.A084281
Number of labeled 5-colorable (i.e., chromatic number <= 5) graphs on n nodes.
- Number of labeled 6-colorable (i.e., chromatic number <= 6) graphs on n nodes.A084282
Number of labeled 6-colorable (i.e., chromatic number <= 6) graphs on n nodes.
- Number of connected labeled 3-colorable (i.e., chromatic number <= 3) graphs on n nodes.A084283
Number of connected labeled 3-colorable (i.e., chromatic number <= 3) graphs on n nodes.
- Number of connected labeled 4-colorable (i.e., chromatic number <= 4) graphs on n nodes.A084284
Number of connected labeled 4-colorable (i.e., chromatic number <= 4) graphs on n nodes.
- Number of connected labeled 5-colorable (i.e., chromatic number <= 5) graphs on n nodes.A084285
Number of connected labeled 5-colorable (i.e., chromatic number <= 5) graphs on n nodes.
- Number of connected labeled 6-colorable (i.e., chromatic number <= 6) graphs on n nodes.A084286
Number of connected labeled 6-colorable (i.e., chromatic number <= 6) graphs on n nodes.
- Self-similar table, read by antidiagonals, where the k-th row is the product of the k-th prime with the antidiagonals of the first k rows of the table.A084287
Self-similar table, read by antidiagonals, where the k-th row is the product of the k-th prime with the antidiagonals of the first k rows of the table.
- Antidiagonal sums of table A084287, in which the k-th row is the product of the k-th prime with the antidiagonals of the first k rows of the table.A084288
Antidiagonal sums of table A084287, in which the k-th row is the product of the k-th prime with the antidiagonals of the first k rows of the table.
- Primes p such that the arithmetic mean of p and the next prime after p is a true prime power from A025475.A084289
Primes p such that the arithmetic mean of p and the next prime after p is a true prime power from A025475.
- Difference between consecutive primes arising before difference (d=2) between twin primes. In A001223, terms before the ones that equal 2.A084290
Difference between consecutive primes arising before difference (d=2) between twin primes. In A001223, terms before the ones that equal 2.
- Difference between consecutive primes arising after difference (d=2) between twin primes. In A001223, terms succeeding those that equal 2.A084291
Difference between consecutive primes arising after difference (d=2) between twin primes. In A001223, terms succeeding those that equal 2.
- a(n) = 6n + A054904(n).A084292
a(n) = 6n + A054904(n).
- a(n) = 2n + A054905(n).A084293
a(n) = 2n + A054905(n).
- Number of primes in the interval [prime(n),n+prime(n)].A084294
Number of primes in the interval [prime(n),n+prime(n)].
- n is such that pi(n*prime(n))/n is an integer.A084295
n is such that pi(n*prime(n))/n is an integer.
- Triangle: number of distinct prime factors in n-th primorial numbers when n prime factors first appears and in n-1 subsequent integers after.A084296
Triangle: number of distinct prime factors in n-th primorial numbers when n prime factors first appears and in n-1 subsequent integers after.
- Primes p=prime(m) such that pi(m*p)/m is an integer.A084297
Primes p=prime(m) such that pi(m*p)/m is an integer.
- Integer quotients pi(m*prime(m))/m.A084298
Integer quotients pi(m*prime(m))/m.
- Smallest primes such that the subsequent terms of consecutive prime differences (A001223) modulo 6 (A054763) displays repeatedly n times a {0,2,4} pattern of remainders of differences.A084299
Smallest primes such that the subsequent terms of consecutive prime differences (A001223) modulo 6 (A054763) displays repeatedly n times a {0,2,4} pattern of remainders of differences.
- a(n) = phi(n) mod 6.A084300
a(n) = phi(n) mod 6.
- a(n) = sigma(n) mod 6.A084301
a(n) = sigma(n) mod 6.
- Remainder of tau(n) modulo 6.A084302
Remainder of tau(n) modulo 6.
- Smallest x such that sigma(x) mod 6 = n.A084303
Smallest x such that sigma(x) mod 6 = n.
- Continued fraction expansion of tanh(Pi^2).A084304
Continued fraction expansion of tanh(Pi^2).
- Continued fraction expansion of tanh(tanh(1)).A084305
Continued fraction expansion of tanh(tanh(1)).
- Numbers m not divisible by 6 such that sigma(m) == 12 (mod m).A084306
Numbers m not divisible by 6 such that sigma(m) == 12 (mod m).
- a(n) is the least number x such that gcd(sigma(x), sigma(x+1)) = n.A084307
a(n) is the least number x such that gcd(sigma(x), sigma(x+1)) = n.
- Duplicate of A067605.A084308
Duplicate of A067605.
- a(n) = gcd(prime(n)-1, n).A084309
a(n) = gcd(prime(n)-1, n).
- a(n) = gcd(prime(n)+1, n).A084310
a(n) = gcd(prime(n)+1, n).