Sequences
392,541 sequences
- Determinant of the n X n matrix whose element (i,j) equals sigma(|i-j|) where sigma(n) is the sum of divisors of n and sigma(0) = 0.A085511
Determinant of the n X n matrix whose element (i,j) equals sigma(|i-j|) where sigma(n) is the sum of divisors of n and sigma(0) = 0.
- Numbers k such that (89 + 10^(2*k+1))/99 is prime.A085512
Numbers k such that (89 + 10^(2*k+1))/99 is prime.
- Number of "e"s in n (in English).A085513
Number of "e"s in n (in English).
- Integers n representable as the product of the sum of three nonzero integers with the sum of their reciprocals: n=(x+y+z)*(1/x+1/y+1/z).A085514
Integers n representable as the product of the sum of three nonzero integers with the sum of their reciprocals: n=(x+y+z)*(1/x+1/y+1/z).
- Order of first occurrence of a sequence of exactly n consecutive primes of the form 6*k+1.A085515
Order of first occurrence of a sequence of exactly n consecutive primes of the form 6*k+1.
- Order of first occurrence of a sequence of exactly n consecutive primes of the form 6*k-1.A085516
Order of first occurrence of a sequence of exactly n consecutive primes of the form 6*k-1.
- Weight enumerator of [16,7,6] extended BCH code.A085517
Weight enumerator of [16,7,6] extended BCH code.
- One of the three possible weight distributions for a [16,7,6] binary code.A085518
One of the three possible weight distributions for a [16,7,6] binary code.
- One of the three possible weight distributions for a [16,7,6] binary code.A085519
One of the three possible weight distributions for a [16,7,6] binary code.
- Numbers whose digits alternate between prime and nonprime.A085520
Numbers whose digits alternate between prime and nonprime.
- a(n) = Product_{k=0..n} (2^(2k+1)+1).A085521
a(n) = Product_{k=0..n} (2^(2k+1)+1).
- Product_{k=0..n} (3^(2k+1)+1).A085522
Product_{k=0..n} (3^(2k+1)+1).
- Product_{k=0..n} (4^(2k+1)+1).A085523
Product_{k=0..n} (4^(2k+1)+1).
- a(0) = 0; a(n) = n^(2*n-1) for n > 0.A085524
a(0) = 0; a(n) = n^(2*n-1) for n > 0.
- a(n) = n^(2*n + 2).A085525
a(n) = n^(2*n + 2).
- a(n) = n^(2n+1).A085526
a(n) = n^(2n+1).
- a(n) = (2n+1)^n.A085527
a(n) = (2n+1)^n.
- a(n) = (2*n+1)^(n+1).A085528
a(n) = (2*n+1)^(n+1).
- a(n) = (2n+1)^(2n+1).A085529
a(n) = (2n+1)^(2n+1).
- a(n) = (2n+1)^(2n).A085530
a(n) = (2n+1)^(2n).
- a(n) = (2*n+1)^(2*n-1).A085531
a(n) = (2*n+1)^(2*n-1).
- (2n)^(n+1).A085532
(2n)^(n+1).
- a(n) = (2n)^(2n+1).A085533
a(n) = (2n)^(2n+1).
- a(n) = (2n)^(2n).A085534
a(n) = (2n)^(2n).
- a(n) = (2n)^(2n-1).A085535
a(n) = (2n)^(2n-1).
- a(n) = (3n)^(3n).A085536
a(n) = (3n)^(3n).
- a(n) = n^4 - n^3.A085537
a(n) = n^4 - n^3.
- a(n) = n^5 - n^4.A085538
a(n) = n^5 - n^4.
- a(n) = n^6 - n^5.A085539
a(n) = n^6 - n^5.
- a(n) = n*(n + 1)^3.A085540
a(n) = n*(n + 1)^3.
- Decimal expansion of the prime zeta function at 3.A085541
Decimal expansion of the prime zeta function at 3.
- Determinant of the n X n matrix M_(i,j)=i/gcd(i,j)=lcm(i,j)/j.A085542
Determinant of the n X n matrix M_(i,j)=i/gcd(i,j)=lcm(i,j)/j.
- Number of divisors of the partition numbers (A000041).A085543
Number of divisors of the partition numbers (A000041).
- n-th partition number (A000041) sets a new record for number of divisors.A085544
n-th partition number (A000041) sets a new record for number of divisors.
- Smaller of number pairs from A054038 which together use all ten digits once.A085545
Smaller of number pairs from A054038 which together use all ten digits once.
- Starting term of the smallest n-chain of numbers whose squares are permutations of the same digits.A085546
Starting term of the smallest n-chain of numbers whose squares are permutations of the same digits.
- a(n) is the maximal row sum in the character table of the symmetric group S_n.A085547
a(n) is the maximal row sum in the character table of the symmetric group S_n.
- Decimal expansion of the prime zeta function at 2: Sum_{p prime} 1/p^2.A085548
Decimal expansion of the prime zeta function at 2: Sum_{p prime} 1/p^2.
- Number of isomorphism classes of connected 4-regular multigraphs of order n, loops allowed.A085549
Number of isomorphism classes of connected 4-regular multigraphs of order n, loops allowed.
- Decimal expansion of (sqrt(13)-3)/2.A085550
Decimal expansion of (sqrt(13)-3)/2.
- Decimal expansion of (sqrt(29)-5)/2.A085551
Decimal expansion of (sqrt(29)-5)/2.
- n-th digit after decimal point of (sqrt(n^2+4)-n)/2.A085552
n-th digit after decimal point of (sqrt(n^2+4)-n)/2.
- Lesser of twin primes of the form x^2+4, x^2+6.A085553
Lesser of twin primes of the form x^2+4, x^2+6.
- Greater of twin primes of the form x^2+2, x^2+4.A085554
Greater of twin primes of the form x^2+2, x^2+4.
- Primes p of the form x^2+4, such that either p-2 or p+2 is prime.A085555
Primes p of the form x^2+4, such that either p-2 or p+2 is prime.
- Numbers that have exactly as many prime digits as nonprime digits.A085556
Numbers that have exactly as many prime digits as nonprime digits.
- Numbers that have more prime digits than nonprime digits.A085557
Numbers that have more prime digits than nonprime digits.
- Numbers that have more nonprime digits than prime digits.A085558
Numbers that have more nonprime digits than prime digits.
- Smallest number expressible as the sum of three 4th powers in at least n ways.A085559
Smallest number expressible as the sum of three 4th powers in at least n ways.
- a(0) = 1, then (for n>0) a(n) = floor[(e + 1/e)*a(n-1) - a(n-2)].A085560
a(0) = 1, then (for n>0) a(n) = floor[(e + 1/e)*a(n-1) - a(n-2)].