Sequences
392,541 sequences
- Symmetric version of square array A086460, read by antidiagonals.A086461
Symmetric version of square array A086460, read by antidiagonals.
- Expansion of (1+x)*(1+4*x)/((1-x)*(1-4*x)).A086462
Expansion of (1+x)*(1+4*x)/((1-x)*(1-4*x)).
- Decimal expansion of Pi^2/18.A086463
Decimal expansion of Pi^2/18.
- Decimal expansion of (17/36)*zeta(4).A086464
Decimal expansion of (17/36)*zeta(4).
- Decimal expansion of (5 + 4*sqrt(5)*arcsch(2))/25.A086465
Decimal expansion of (5 + 4*sqrt(5)*arcsch(2))/25.
- Decimal expansion of 2*arccsch(2)/sqrt(5).A086466
Decimal expansion of 2*arccsch(2)/sqrt(5).
- Decimal expansion of 2*arccsch(2)^2.A086467
Decimal expansion of 2*arccsch(2)^2.
- Decimal expansion of 2*zeta(3)/5.A086468
Decimal expansion of 2*zeta(3)/5.
- Sum of the distinct (smallest) prime signature divisors of n. In case of two or more divisors with the same prime signature the smallest is considered to evaluate the sum. Let this function be defined as psigma(n).A086469
Sum of the distinct (smallest) prime signature divisors of n. In case of two or more divisors with the same prime signature the smallest is considered to evaluate the sum. Let this function be defined as psigma(n).
- Numbers k such that psigma(k) = psigma(k+1), where psigma(k) = A086469(k).A086470
Numbers k such that psigma(k) = psigma(k+1), where psigma(k) = A086469(k).
- Product of distinct (smallest) prime signature divisors. In case of two or more divisors with the same prime signature the smallest is considered to evaluate the product.A086471
Product of distinct (smallest) prime signature divisors. In case of two or more divisors with the same prime signature the smallest is considered to evaluate the product.
- Primes which are sum of two palindromes.A086472
Primes which are sum of two palindromes.
- Numbers in A058080 having only one factor pair (both distinct from 1) that add up to a sum belonging to A014092.A086473
Numbers in A058080 having only one factor pair (both distinct from 1) that add up to a sum belonging to A014092.
- a(1) = 4 and then least composite such that every partial concatenation of 2 or more terms is a prime.A086474
a(1) = 4 and then least composite such that every partial concatenation of 2 or more terms is a prime.
- a(1) = 1 and then least squarefree number such that every partial concatenation of 2 or more terms is a prime.A086475
a(1) = 1 and then least squarefree number such that every partial concatenation of 2 or more terms is a prime.
- Primes p such that 32p+1 and (p-1)/32 are both prime.A086476
Primes p such that 32p+1 and (p-1)/32 are both prime.
- Primes p such that 128p+1 and (p-1)/128 are both prime.A086477
Primes p such that 128p+1 and (p-1)/128 are both prime.
- Primes p such that 512p+1 and (p-1)/512 are both prime.A086478
Primes p such that 512p+1 and (p-1)/512 are both prime.
- Number of invertible circulant (0,1) matrices over the reals that have even determinant.A086479
Number of invertible circulant (0,1) matrices over the reals that have even determinant.
- Erroneous version of A056135.A086480
Erroneous version of A056135.
- Erroneous version of A072905.A086481
Erroneous version of A072905.
- Beginning with 1, the smallest number not included earlier such that the n-th partial product is an n-th power; or the geometric mean of the first n terms is an integer.A086482
Beginning with 1, the smallest number not included earlier such that the n-th partial product is an n-th power; or the geometric mean of the first n terms is an integer.
- Bit that is two places to left of least significant 1-bit in the binary expansion of n.A086483
Bit that is two places to left of least significant 1-bit in the binary expansion of n.
- Let k be the largest number such that n is a k-th power; then a(n) is the least positive number m such that m + n is a (k+1)st power.A086484
Let k be the largest number such that n is a k-th power; then a(n) is the least positive number m such that m + n is a (k+1)st power.
- Duplicate of A068310.A086485
Duplicate of A068310.
- Numbers k such that the sum of the distinct prime divisors divides rad(k)=A007947(k).A086486
Numbers k such that the sum of the distinct prime divisors divides rad(k)=A007947(k).
- Smallest number with n prime divisors such that the sum of the prime divisors is also a divisor, or 0 if no such number exists.A086487
Smallest number with n prime divisors such that the sum of the prime divisors is also a divisor, or 0 if no such number exists.
- A086487(n)/S where S is the sum of the prime divisors.A086488
A086487(n)/S where S is the sum of the prime divisors.
- Smallest k such that k and k + n have the same prime signature.A086489
Smallest k such that k and k + n have the same prime signature.
- Duplicate of A085876.A086490
Duplicate of A085876.
- Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains the sum of the terms in the n-th group.A086491
Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains the sum of the terms in the n-th group.
- Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains (the sum of the terms in the n-th group)/prime(n): a(n) = A086491(n)/prime(n).A086492
Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains (the sum of the terms in the n-th group)/prime(n): a(n) = A086491(n)/prime(n).
- Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains the first term of every group.A086493
Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains the first term of every group.
- Group the natural numbers such that the sum of the terms of every group has a distinct prime signature not occurring earlier: (1), (2), (3, 4, 5), (6), (7, 8, 9), (10, 11, 12, 13, 14), (15, 16, 17), (18, 19, 20, 21)... Sequence contains the sum of the terms of groups.A086494
Group the natural numbers such that the sum of the terms of every group has a distinct prime signature not occurring earlier: (1), (2), (3, 4, 5), (6), (7, 8, 9), (10, 11, 12, 13, 14), (15, 16, 17), (18, 19, 20, 21)... Sequence contains the sum of the terms of groups.
- Group the natural numbers such that the sum of the terms of every group has a distinct prime signature not occurring earlier: (1), (2), (3, 4, 5), (6), (7, 8, 9), (10, 11, 12, 13, 14), (15, 16, 17), (18, 19, 20, 21)... Sequence contains the first term of every group.A086495
Group the natural numbers such that the sum of the terms of every group has a distinct prime signature not occurring earlier: (1), (2), (3, 4, 5), (6), (7, 8, 9), (10, 11, 12, 13, 14), (15, 16, 17), (18, 19, 20, 21)... Sequence contains the first term of every group.
- Rearrangement of natural numbers such that every 2n-th partial sum is prime. Every (2n+1)-th term is the smallest number not included earlier.A086496
Rearrangement of natural numbers such that every 2n-th partial sum is prime. Every (2n+1)-th term is the smallest number not included earlier.
- Primes arising in A086496. a(n) = Sum {A086946(k), k = 1 to 2n}= 2n-th partial sum of A086496.A086497
Primes arising in A086496. a(n) = Sum {A086946(k), k = 1 to 2n}= 2n-th partial sum of A086496.
- Rearrangement of primes such that every (2n)-th partial sum is a prime. Every (2n+1)-st term is the smallest prime which has not been included earlier.A086498
Rearrangement of primes such that every (2n)-th partial sum is a prime. Every (2n+1)-st term is the smallest prime which has not been included earlier.
- Primes arising in A086498: a(n) = (2n)-th partial sum of A086498.A086499
Primes arising in A086498: a(n) = (2n)-th partial sum of A086498.
- Group the natural numbers such that the n-th group sum is divisible by the n-th triangular number: (1), (2, 3, 4), (5, 6, 7), (8, 9, 10, 11, 12), (13, 14, 15, 16, 17), (18, 19, 20, 21, 22, 23, 24), ... Sequence contains the group sum.A086500
Group the natural numbers such that the n-th group sum is divisible by the n-th triangular number: (1), (2, 3, 4), (5, 6, 7), (8, 9, 10, 11, 12), (13, 14, 15, 16, 17), (18, 19, 20, 21, 22, 23, 24), ... Sequence contains the group sum.
- Number of non-commuting permutations: number of ordered pairs g, h in Symm(n) such that gh <> hg, i.e., the subgroup <g,h> is non-Abelian.A086501
Number of non-commuting permutations: number of ordered pairs g, h in Symm(n) such that gh <> hg, i.e., the subgroup <g,h> is non-Abelian.
- Number of ordered pairs (a,b) of elements of the symmetric group S_n such that the pair a,b generates a proper subgroup of S_n.A086502
Number of ordered pairs (a,b) of elements of the symmetric group S_n such that the pair a,b generates a proper subgroup of S_n.
- (Fibonacci(p^2) - 1)/p where p runs through the primes (except p = 5).A086503
(Fibonacci(p^2) - 1)/p where p runs through the primes (except p = 5).
- Nonprimes k that divide (Fibonacci(k^2)-1).A086504
Nonprimes k that divide (Fibonacci(k^2)-1).
- a(n) is the n-th smallest prime p such that p+2n is also prime.A086505
a(n) is the n-th smallest prime p such that p+2n is also prime.
- a(1) = 2, a(2n) = smallest prime of the type r*a(2n-1) +1, a(2n+1) = smallest prime of the type s*a(2n) -1.A086506
a(1) = 2, a(2n) = smallest prime of the type r*a(2n-1) +1, a(2n+1) = smallest prime of the type s*a(2n) -1.
- If n is even, a(n) = smallest prime == 1 (mod n), If n is odd, a(n) = smallest prime == -1 (mod n).A086507
If n is even, a(n) = smallest prime == 1 (mod n), If n is odd, a(n) = smallest prime == -1 (mod n).
- If n is even, a(n) = smallest prime == -1 (mod n), If n is odd, a(n) = smallest prime == 1 (mod n).A086508
If n is even, a(n) = smallest prime == -1 (mod n), If n is odd, a(n) = smallest prime == 1 (mod n).
- Numbers n such that p=n^2+2, p+2, p+6, p+8 and p+12 are five consecutive primes.A086509
Numbers n such that p=n^2+2, p+2, p+6, p+8 and p+12 are five consecutive primes.
- Number of n X n real (0,1)-matrices with all eigenvalues >= 0.A086510
Number of n X n real (0,1)-matrices with all eigenvalues >= 0.