Sequences
392,541 sequences
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A074683/A074684.A089411
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A074683/A074684.
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A074683/A074684.A089412
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A074683/A074684.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.A089413
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.A089414
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.A089415
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A071655/A071656.
- Odd-indexed terms of A089413.A089416
Odd-indexed terms of A089413.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.A089417
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.
- Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.A089418
Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.A089419
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.A089420
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A082333/A082334.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336.A089421
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336 (and also of A082349/A082350, to be proved).A089422
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336 (and also of A082349/A082350, to be proved).
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336 (and also of A082349/A082350, to be proved).A089423
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336 (and also of A082349/A082350, to be proved).
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082351/A082352.A089424
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082351/A082352.
- Least common multiple of all cycle sizes (and also the maximum cycle size) in range [A014137(n-1)..A014138(n-1)] of permutation A082351/A082352.A089425
Least common multiple of all cycle sizes (and also the maximum cycle size) in range [A014137(n-1)..A014138(n-1)] of permutation A082351/A082352.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082355/A082356.A089426
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082355/A082356.
- Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082355/A082356.A089427
Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082355/A082356.
- Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A082355/A082356.A089428
Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A082355/A082356.
- Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082339/A082340.A089429
Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A082339/A082340.
- Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A082339/A082340.A089430
Number of fixed points in range [A014137(n-1)..A014138(n-1)] of permutation A082339/A082340.
- Even-indexed terms of A089423.A089431
Even-indexed terms of A089423.
- Numbers n such that n concatenated with floor(n/2) is prime.A089432
Numbers n such that n concatenated with floor(n/2) is prime.
- Number of noncrossing connected graphs on n nodes having exactly two interior faces.A089433
Number of noncrossing connected graphs on n nodes having exactly two interior faces.
- Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....A089434
Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
- Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....A089435
Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k triangles. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....
- Number of non-crossing connected graphs on n nodes on a circle in which a fixed (distinguished) node has degree one.A089436
Number of non-crossing connected graphs on n nodes on a circle in which a fixed (distinguished) node has degree one.
- Numbers k such that 4^k + 3 is prime.A089437
Numbers k such that 4^k + 3 is prime.
- Primes p such that 6p+11 is also a prime.A089438
Primes p such that 6p+11 is also a prime.
- 6p+13 and p are primes.A089439
6p+13 and p are primes.
- 14*p+13 and p are primes.A089440
14*p+13 and p are primes.
- Primes p such that 16*p+17 is a prime.A089441
Primes p such that 16*p+17 is a prime.
- Primes p such that (p-11)/10 is also a prime.A089442
Primes p such that (p-11)/10 is also a prime.
- Primes p such that 12*p + 13 is prime.A089443
Primes p such that 12*p + 13 is prime.
- Smallest 6-tuple of consecutive primes such that a(n)+a(n+1)+a(n+2), n=1...4, are again consecutive primes.A089444
Smallest 6-tuple of consecutive primes such that a(n)+a(n+1)+a(n+2), n=1...4, are again consecutive primes.
- Smallest 7-tuple of consecutive primes such that a(n)+a(n+1)+a(n+2)+a(n+3)+a(n+4), n=1...3, are again consecutive primes.A089445
Smallest 7-tuple of consecutive primes such that a(n)+a(n+1)+a(n+2)+a(n+3)+a(n+4), n=1...3, are again consecutive primes.
- Members of 7-tuples of consecutive primes (p(k),p(k+1),...,p(k+6)) such that p(n)+p(n+1)+...+p(n+4), n=k,...,k+2, are again 3 consecutive primes.A089446
Members of 7-tuples of consecutive primes (p(k),p(k+1),...,p(k+6)) such that p(n)+p(n+1)+...+p(n+4), n=k,...,k+2, are again 3 consecutive primes.
- Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.A089447
Symmetric square table of coefficients, read by antidiagonals, where T(n,k) is the coefficient of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.
- Diagonal of square table A089447, which lists the coefficients of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.A089448
Diagonal of square table A089447, which lists the coefficients of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.
- Antidiagonal sums of square table A089447, which lists the coefficients of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.A089449
Antidiagonal sums of square table A089447, which lists the coefficients of x^n*y^k in f(x,y) that satisfies: f(x,y) = g(x,y) + xy*f(x,y)^4 and where g(x,y) satisfies: 1 + (x+y-1)*g(x,y) + xy*g(x,y)^2 = 0.
- Sequence of primes 2*p(k) + 3 such that 2*p(k) + 3, 2*p(k+1) + 3, 2*p(k+2) + 3 are consecutive primes, where p(i) denotes the i-th prime. Sequence terms are 2*p(k) + 3.A089450
Sequence of primes 2*p(k) + 3 such that 2*p(k) + 3, 2*p(k+1) + 3, 2*p(k+2) + 3 are consecutive primes, where p(i) denotes the i-th prime. Sequence terms are 2*p(k) + 3.
- a(n) = mu(prime(n)-1), where mu is the Moebius function (A008683).A089451
a(n) = mu(prime(n)-1), where mu is the Moebius function (A008683).
- a(n) = smallest prime k such that k*(prime(n)-1) + prime(n) is prime.A089452
a(n) = smallest prime k such that k*(prime(n)-1) + prime(n) is prime.
- Sums of squares of primitive roots of primes.A089453
Sums of squares of primitive roots of primes.
- Number of n-celled polyominoes with exactly 2 holes.A089454
Number of n-celled polyominoes with exactly 2 holes.
- Number of n-celled polyominoes with exactly 3 holes.A089455
Number of n-celled polyominoes with exactly 3 holes.
- Number of n-celled polyominoes with exactly 4 holes.A089456
Number of n-celled polyominoes with exactly 4 holes.
- Number of n-celled polyominoes with exactly 5 holes.A089457
Number of n-celled polyominoes with exactly 5 holes.
- Number of n-celled polyominoes with exactly 6 holes.A089458
Number of n-celled polyominoes with exactly 6 holes.
- Shifts 2 places left under the hyperbinomial transform.A089459
Shifts 2 places left under the hyperbinomial transform.
- Triangle, read by rows, of coefficients for the second iteration of the hyperbinomial transform.A089460
Triangle, read by rows, of coefficients for the second iteration of the hyperbinomial transform.