Sequences
392,541 sequences
- Difference between A007678(2n)/(2n) and (n-1)^2.A085611
Difference between A007678(2n)/(2n) and (n-1)^2.
- Triangle in which the n-th row contains n numbers (beginning with the smallest unused value) that have the same prime signature as the first entry on that row.A085612
Triangle in which the n-th row contains n numbers (beginning with the smallest unused value) that have the same prime signature as the first entry on that row.
- a(n) = 2^(n-1) + (2 + (-1)^n)^((n-2)/2).A085613
a(n) = 2^(n-1) + (2 + (-1)^n)^((n-2)/2).
- Number of elementary arches of size n.A085614
Number of elementary arches of size n.
- Duplicate of A054726.A085615
Duplicate of A054726.
- Numbers n == 3 (mod 8) such that there is only one solution to i^2+j^2+k^2=n, i >= j >= k >= 0.A085616
Numbers n == 3 (mod 8) such that there is only one solution to i^2+j^2+k^2=n, i >= j >= k >= 0.
- Number of nonisomorphic 2-graphs with 2n nodes with first cohomology invariant nonzero, second cohomology invariant 0.A085617
Number of nonisomorphic 2-graphs with 2n nodes with first cohomology invariant nonzero, second cohomology invariant 0.
- Number of self-complementary 2-graphs with n nodes.A085618
Number of self-complementary 2-graphs with n nodes.
- Number of 2-graphs with n nodes and integral spectrum.A085619
Number of 2-graphs with n nodes and integral spectrum.
- Number of 2-graphs with n nodes and transitive automorphism group.A085620
Number of 2-graphs with n nodes and transitive automorphism group.
- Mean prime gaps that do not occur in A049036.A085621
Mean prime gaps that do not occur in A049036.
- Maximal number of segments (equivalently, corners) in a rook circuit of a 2n X 2n board.A085622
Maximal number of segments (equivalently, corners) in a rook circuit of a 2n X 2n board.
- Let p = n-th prime; a(n) = number of pairs (i,j) with 0 < i < p, 0 < j < p such that i*j == 1 mod p and i and j have opposite parity.A085623
Let p = n-th prime; a(n) = number of pairs (i,j) with 0 < i < p, 0 < j < p such that i*j == 1 mod p and i and j have opposite parity.
- Sum of the entries in the character table of the dihedral group D_{2n} of order 2n.A085624
Sum of the entries in the character table of the dihedral group D_{2n} of order 2n.
- Numbers that are the sum of 2 squares in exactly 2 ways.A085625
Numbers that are the sum of 2 squares in exactly 2 ways.
- Partial sums of A051935.A085626
Partial sums of A051935.
- Number of divisors of n-th highly powerful number.A085627
Number of divisors of n-th highly powerful number.
- Number of antisymmetric transitive binary relations on n labeled points.A085628
Number of antisymmetric transitive binary relations on n labeled points.
- Let b(n) equal the product of the exponents in the prime factorization of n. Then a(n) gives the least k such that b(k) = n.A085629
Let b(n) equal the product of the exponents in the prime factorization of n. Then a(n) gives the least k such that b(k) = n.
- Number of n-digit 7-smooth numbers (A002473).A085630
Number of n-digit 7-smooth numbers (A002473).
- Let b(n)=product of exponents of prime factorization of n. Sequence gives palindromes n such that b(n) is also palindromic and sets a new record.A085631
Let b(n)=product of exponents of prime factorization of n. Sequence gives palindromes n such that b(n) is also palindromic and sets a new record.
- Number of connected coin graphs, also known as "penny" graphs.A085632
Number of connected coin graphs, also known as "penny" graphs.
- Number of not necessarily connected coin graphs, also known as "penny" graphs.A085633
Number of not necessarily connected coin graphs, also known as "penny" graphs.
- Numbers of the form 2^a + 3^b = 2^c + 3^d for nonnegative a, b, c, d and a <> c.A085634
Numbers of the form 2^a + 3^b = 2^c + 3^d for nonnegative a, b, c, d and a <> c.
- Compute S, the number of different quadratic residues modulo B for every base B. If the density S/B is smaller for B than for every B' less than B, then B is added to the sequence.A085635
Compute S, the number of different quadratic residues modulo B for every base B. If the density S/B is smaller for B than for every B' less than B, then B is added to the sequence.
- Erroneous version of A046142.A085636
Erroneous version of A046142.
- Numbers k such that k*prime(k) -+ 1 are twin primes.A085637
Numbers k such that k*prime(k) -+ 1 are twin primes.
- Resultant of the polynomial x^n-1 and the Hermite polynomial H_n(x).A085638
Resultant of the polynomial x^n-1 and the Hermite polynomial H_n(x).
- Ramanujan sum c_n(5).A085639
Ramanujan sum c_n(5).
- Resultant of the polynomial x^3-1 and the Chebyshev polynomial of the first kind T_n(x).A085640
Resultant of the polynomial x^3-1 and the Chebyshev polynomial of the first kind T_n(x).
- Smallest prime == 1 (mod p*q*...*k) where p, q, ..., k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest squarefree divisor of n).A085641
Smallest prime == 1 (mod p*q*...*k) where p, q, ..., k are all the distinct prime divisors of n. Or, smallest prime == 1 (mod the largest squarefree divisor of n).
- Number of columns in the character table of the symmetric group S_n that have zero sum.A085642
Number of columns in the character table of the symmetric group S_n that have zero sum.
- Irregular triangle T(n,k) = A048996(n,k) * A118851(n,k), read by rows, 1 <= k <= A000041(n).A085643
Irregular triangle T(n,k) = A048996(n,k) * A118851(n,k), read by rows, 1 <= k <= A000041(n).
- a(0) = 1; a(n+1) = a(n)*2n + 2n + 1.A085644
a(0) = 1; a(n+1) = a(n)*2n + 2n + 1.
- Smallest number having n divisors ending with 1 or 9.A085645
Smallest number having n divisors ending with 1 or 9.
- Sum of the entries in the character table of the group GL(2,Z_n).A085646
Sum of the entries in the character table of the group GL(2,Z_n).
- Semiprimes whose prime factors p*q have an equal number of decimal digits and p is not equal to q.A085647
Semiprimes whose prime factors p*q have an equal number of decimal digits and p is not equal to q.
- Brilliant numbers (A078972) whose digital sum is also brilliant.A085648
Brilliant numbers (A078972) whose digital sum is also brilliant.
- Brilliant numbers k such that 2k+1 is also brilliant.A085649
Brilliant numbers k such that 2k+1 is also brilliant.
- Least k such that 2^n+k is a brilliant number (A078972).A085650
Least k such that 2^n+k is a brilliant number (A078972).
- Index of the first of two successive 2's in A005361.A085651
Index of the first of two successive 2's in A005361.
- Fibonacci sequence in base 2 of the alternate number system.A085652
Fibonacci sequence in base 2 of the alternate number system.
- a(n) = smallest integer > n where mu(n) = mu(a(n)).A085653
a(n) = smallest integer > n where mu(n) = mu(a(n)).
- Duplicate of A074719.A085654
Duplicate of A074719.
- Difference between number of primes not exceeding reversed n and n.A085655
Difference between number of primes not exceeding reversed n and n.
- Number of positive-definite real {0,1} n X n matrices.A085656
Number of positive-definite real {0,1} n X n matrices.
- Number of n X n symmetric positive definite matrices with 2's on the main diagonal and 1's and 0's elsewhere.A085657
Number of n X n symmetric positive definite matrices with 2's on the main diagonal and 1's and 0's elsewhere.
- Number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere.A085658
Number of n X n symmetric positive semi-definite matrices with 2's on the main diagonal and 1's and 0's elsewhere.
- Decimal expansion of sin(e).A085659
Decimal expansion of sin(e).
- Decimal expansion of -cos(e).A085660
Decimal expansion of -cos(e).