Sequences
392,541 sequences
- Characteristic function of primes of form 4n+3 (1 if n is prime of form 4n+3, 0 otherwise).A079261
Characteristic function of primes of form 4n+3 (1 if n is prime of form 4n+3, 0 otherwise).
- Octanacci numbers: a(0)=a(1)=...=a(6)=0, a(7)=1; for n >= 8, a(n) = Sum_{i=1..8} a(n-i).A079262
Octanacci numbers: a(0)=a(1)=...=a(6)=0, a(7)=1; for n >= 8, a(n) = Sum_{i=1..8} a(n-i).
- Number of constrained mixed models with n factors.A079263
Number of constrained mixed models with n factors.
- Duplicate of A006939.A079264
Duplicate of A006939.
- Number of antisymmetric transitive binary relations on n unlabeled points.A079265
Number of antisymmetric transitive binary relations on n unlabeled points.
- Subprimorials, extrapolation from primorials by analogy with subfactorials.A079266
Subprimorials, extrapolation from primorials by analogy with subfactorials.
- d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.A079267
d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.
- Triangle read by rows: d(n,k) = number of decreasing labeled trees with n nodes and largest leaf <= k, for 1 <= k <= n.A079268
Triangle read by rows: d(n,k) = number of decreasing labeled trees with n nodes and largest leaf <= k, for 1 <= k <= n.
- Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(1+1/b(n-1)); sequence gives numerator of b(n).A079269
Define b by b(1) = 1 and for n>1, b(n) = b(n-1)+1/(1+1/b(n-1)); sequence gives numerator of b(n).
- Nonpalindromic squares k such that reverse(k) - k is a positive cube.A079270
Nonpalindromic squares k such that reverse(k) - k is a positive cube.
- a(n) = 4 * a(n-1) * (3^(2^(n-1))-a(n-1)) with a(0)=1.A079271
a(n) = 4 * a(n-1) * (3^(2^(n-1))-a(n-1)) with a(0)=1.
- a(n) = ((2n+1)*3^n - 1)/2.A079272
a(n) = ((2n+1)*3^n - 1)/2.
- Octo numbers (a polygonal sequence): a(n) = 5*n^2 - 6*n + 2 = (n-1)^2 + (2*n-1)^2.A079273
Octo numbers (a polygonal sequence): a(n) = 5*n^2 - 6*n + 2 = (n-1)^2 + (2*n-1)^2.
- Number of divisors associated with the cyclic cases within the n-th group of least prime signatures.A079274
Number of divisors associated with the cyclic cases within the n-th group of least prime signatures.
- Number of divisors of n that are semiprimes with distinct factors.A079275
Number of divisors of n that are semiprimes with distinct factors.
- Multiplicative inverse in the finite field F(prime(n)) of the product of the first n-1 primes modulo prime(n).A079276
Multiplicative inverse in the finite field F(prime(n)) of the product of the first n-1 primes modulo prime(n).
- Largest integer k < n such that any prime factor of k is also a prime factor of n.A079277
Largest integer k < n such that any prime factor of k is also a prime factor of n.
- Define a rational sequence {b(n)} as b(1) = 1, b(n) = b(n-1) + 1/(1 + 1/b(n-1)) for n > 1; a(n) is the denominator of b(n).A079278
Define a rational sequence {b(n)} as b(1) = 1, b(n) = b(n-1) + 1/(1 + 1/b(n-1)) for n > 1; a(n) is the denominator of b(n).
- a(n)=n for n<=3; for n>3, a(n) is next integer sharing common factors with 1 or 2 of previous 3 terms.A079279
a(n)=n for n<=3; for n>3, a(n) is next integer sharing common factors with 1 or 2 of previous 3 terms.
- Number of log-concave paths of length n starting from the origin (0,0) with steps from {N=(0,1), E=(1,0) and S=(0,-1)} that stay in the second octant and never touch the line y=x except possibly at the beginning or the end.A079280
Number of log-concave paths of length n starting from the origin (0,0) with steps from {N=(0,1), E=(1,0) and S=(0,-1)} that stay in the second octant and never touch the line y=x except possibly at the beginning or the end.
- Number of compositions of 2^n into distinct parts.A079281
Number of compositions of 2^n into distinct parts.
- Diagonal sums of triangle A055249.A079282
Diagonal sums of triangle A055249.
- Marks on lexicographically earliest 6-mark optimal Golomb ruler.A079283
Marks on lexicographically earliest 6-mark optimal Golomb ruler.
- Diagonal sums of triangle A008949.A079284
Diagonal sums of triangle A008949.
- First differences of A079284.A079285
First differences of A079284.
- a(n) = (3^n)! - (2^n)!.A079286
a(n) = (3^n)! - (2^n)!.
- Marks on lexicographically earliest 7-mark optimal Golomb ruler.A079287
Marks on lexicographically earliest 7-mark optimal Golomb ruler.
- a(n) = (3^n)!.A079288
a(n) = (3^n)!.
- For even n, a(n) = a(n-2) + a(n-1) + 2^(n/2-2), n>2. For odd n, a(n) = a(n-2) + a(n-1).A079289
For even n, a(n) = a(n-2) + a(n-1) + 2^(n/2-2), n>2. For odd n, a(n) = a(n-2) + a(n-1).
- Composite numbers satisfying A073078(n)=(n+1)/2.A079290
Composite numbers satisfying A073078(n)=(n+1)/2.
- Squares of Pell numbers.A079291
Squares of Pell numbers.
- Near twin primes of order 12: twin primes p,p+2 such that p+12 and p+14 are primes.A079292
Near twin primes of order 12: twin primes p,p+2 such that p+12 and p+14 are primes.
- Degree of the numerator of Fn(z), the Poincaré series (also Hilbert, Molien series) for C(Vn)^G, where G = SL(2,C) and Vd is the space for binary forms of degree d.A079293
Degree of the numerator of Fn(z), the Poincaré series (also Hilbert, Molien series) for C(Vn)^G, where G = SL(2,C) and Vd is the space for binary forms of degree d.
- Number of distinct prime factors of the numerator of the 2n-th Bernoulli number.A079294
Number of distinct prime factors of the numerator of the 2n-th Bernoulli number.
- (D(p)-6)/(12p) where D(p) denotes the denominator of the 2p-th Bernoulli number and p runs through the primes.A079295
(D(p)-6)/(12p) where D(p) denotes the denominator of the 2p-th Bernoulli number and p runs through the primes.
- Primes ordered by decreasing value of the function p -> sqrt(q) - sqrt(p) where q is the next prime after p.A079296
Primes ordered by decreasing value of the function p -> sqrt(q) - sqrt(p) where q is the next prime after p.
- Triangle read by rows: the k-th column is an arithmetic progression with difference 2k-1 and the top entry is the hexagonal number k*(2*k-1) (A000384).A079297
Triangle read by rows: the k-th column is an arithmetic progression with difference 2k-1 and the top entry is the hexagonal number k*(2*k-1) (A000384).
- Binomial numbers: of the form a^k +- b^k for k >= 2.A079298
Binomial numbers: of the form a^k +- b^k for k >= 2.
- Not a binomial number: not of form a^k +- b^k for k >= 2.A079299
Not a binomial number: not of form a^k +- b^k for k >= 2.
- a(n) = number of shortest addition chains ending in n.A079300
a(n) = number of shortest addition chains ending in n.
- a(n) = number of shortest addition chains for n that are Brauer chains.A079301
a(n) = number of shortest addition chains for n that are Brauer chains.
- a(n) = number of shortest addition chains for n that are non-Brauer chains.A079302
a(n) = number of shortest addition chains for n that are non-Brauer chains.
- a(n) = ((p-1)!/(2*p^2)) * Sum_{j=1..p-1} 1/j where p is the n-th prime.A079303
a(n) = ((p-1)!/(2*p^2)) * Sum_{j=1..p-1} 1/j where p is the n-th prime.
- Near twin primes of order 18: twin primes (p, p+2) such that p+18 and p+20 are primes.A079304
Near twin primes of order 18: twin primes (p, p+2) such that p+18 and p+20 are primes.
- First near twin primes of order 6n: smallest p such that p, p+2, p+6n and p+6n+2 are primes.A079305
First near twin primes of order 6n: smallest p such that p, p+2, p+6n and p+6n+2 are primes.
- Number of n-node labeled mating graphs whose complements are connected.A079306
Number of n-node labeled mating graphs whose complements are connected.
- Number of n-node labeled mating digraphs whose complements are connected.A079307
Number of n-node labeled mating digraphs whose complements are connected.
- For a partition P of a positive integer, let f(P) be the product of k+1, over all parts k in P. Let a(n,r) be the sum of f(P) over all partitions P of n with smallest part r. Sequence gives table of a(n,r) for 1 <= r <= n, in the order a(1,1); a(2,1), a(2,2); a(3,1), a(3,2), a(3,3); ...A079308
For a partition P of a positive integer, let f(P) be the product of k+1, over all parts k in P. Let a(n,r) be the sum of f(P) over all partitions P of n with smallest part r. Sequence gives table of a(n,r) for 1 <= r <= n, in the order a(1,1); a(2,1), a(2,2); a(3,1), a(3,2), a(3,3); ...
- a(n) = C(1,1) + C(3,2) + C(5,3) + ... + C(2*n-1,n).A079309
a(n) = C(1,1) + C(3,2) + C(5,3) + ... + C(2*n-1,n).
- Numbers k such that (6*phi(k)-1, 6*phi(k)+1) is a twin prime pair, where phi is Euler's totient function (A000010).A079310
Numbers k such that (6*phi(k)-1, 6*phi(k)+1) is a twin prime pair, where phi is Euler's totient function (A000010).