Sequences
392,541 sequences
- a(n) = 1 if n is an exponent of the Weyl group W(E_7), 0 otherwise.A089011
a(n) = 1 if n is an exponent of the Weyl group W(E_7), 0 otherwise.
- a(n) = 1 if n is an exponent of the Weyl group W(E_6), 0 otherwise.A089012
a(n) = 1 if n is an exponent of the Weyl group W(E_6), 0 otherwise.
- a(n) = (A088567(8n) mod 2).A089013
a(n) = (A088567(8n) mod 2).
- n*nextprime((n-1)!)-nextprime(n!).A089014
n*nextprime((n-1)!)-nextprime(n!).
- Least odd short leg of n primitive Pythagorean triangles.A089015
Least odd short leg of n primitive Pythagorean triangles.
- Largest n-round number.A089016
Largest n-round number.
- n for which the number consisting of a string of n 3's and a terminal 1 is not prime.A089017
n for which the number consisting of a string of n 3's and a terminal 1 is not prime.
- Smallest prime dividing the composite number consisting of A089017(n) successive 3's followed by a terminal 1.A089018
Smallest prime dividing the composite number consisting of A089017(n) successive 3's followed by a terminal 1.
- First nontrivial x satisfying x^2 - 3*y^2 = d^2, where d=A072330(n).A089019
First nontrivial x satisfying x^2 - 3*y^2 = d^2, where d=A072330(n).
- First value y satisfying x^2 - 3*y^2 = d^2, where d=A072330(n).A089020
First value y satisfying x^2 - 3*y^2 = d^2, where d=A072330(n).
- Values associated with sequence A087004(n).A089021
Values associated with sequence A087004(n).
- Number of walks of length 2n on the 3-regular tree beginning and ending at some fixed vertex.A089022
Number of walks of length 2n on the 3-regular tree beginning and ending at some fixed vertex.
- Duplicate of A035610.A089023
Duplicate of A035610.
- 1's separated by d(n) 0's, where d(n) = n-th digit of decimal expansion of Pi.A089024
1's separated by d(n) 0's, where d(n) = n-th digit of decimal expansion of Pi.
- Side of primitive equilateral triangle bearing at least one integral cevian that partitions an edge into two integral sections.A089025
Side of primitive equilateral triangle bearing at least one integral cevian that partitions an edge into two integral sections.
- a(n) = n if n is a prime, otherwise a(n) = 1.A089026
a(n) = n if n is a prime, otherwise a(n) = 1.
- a(n) =1 if the prime gap A001223(n) is <=2, otherwise a(n)=n+1.A089027
a(n) =1 if the prime gap A001223(n) is <=2, otherwise a(n)=n+1.
- a(n) = n+1 where the Hofstadter-Conway Delta A093878(n) >0, otherwise a(n) = 1.A089028
a(n) = n+1 where the Hofstadter-Conway Delta A093878(n) >0, otherwise a(n) = 1.
- a(n)=n if Hofstadter's Q-sequence increases A005185(n-1)->A005185(n), a(n)=1 otherwise.A089029
a(n)=n if Hofstadter's Q-sequence increases A005185(n-1)->A005185(n), a(n)=1 otherwise.
- Ordered values k in primitive Pythagorean triangles (3i,4j,5k), with 3i<4j<5k.A089030
Ordered values k in primitive Pythagorean triangles (3i,4j,5k), with 3i<4j<5k.
- Values j in primitive Pythagorean triangles (3i,4j,5k), with 3i<4j<5k, sorted on k, then on j.A089031
Values j in primitive Pythagorean triangles (3i,4j,5k), with 3i<4j<5k, sorted on k, then on j.
- Values i in primitive Pythagorean triangles (3i,4j,5k), with 3i<4j<5k, sorted on k, then on j.A089032
Values i in primitive Pythagorean triangles (3i,4j,5k), with 3i<4j<5k, sorted on k, then on j.
- Numbers n such that 7*n+3 is prime.A089033
Numbers n such that 7*n+3 is prime.
- a(n) = (prime(n)^4 - 1) / 240.A089034
a(n) = (prime(n)^4 - 1) / 240.
- Number of n X n matrices over GF(2) with characteristic polynomial x^n - 1.A089035
Number of n X n matrices over GF(2) with characteristic polynomial x^n - 1.
- Number of n X n matrices over GF(3) with characteristic polynomial x^n - 1.A089036
Number of n X n matrices over GF(3) with characteristic polynomial x^n - 1.
- Number of n X n matrices over GF(5) with characteristic polynomial x^n - 1.A089037
Number of n X n matrices over GF(5) with characteristic polynomial x^n - 1.
- Nonnegative numbers k such that 2k+5 is prime.A089038
Nonnegative numbers k such that 2k+5 is prime.
- Number of circular permutations of 2n letters that are free of jealousy.A089039
Number of circular permutations of 2n letters that are free of jealousy.
- Number of primitive partition identities with largest part n.A089040
Number of primitive partition identities with largest part n.
- Inverse binomial transform of squares of factorial numbers.A089041
Inverse binomial transform of squares of factorial numbers.
- Composite numbers such that all divisors >1 have the same number of 1's in binary representation.A089042
Composite numbers such that all divisors >1 have the same number of 1's in binary representation.
- a(n) = n!^2 + (-1)^n.A089043
a(n) = n!^2 + (-1)^n.
- Numbers n such that abs(d(n) - log(n) + 1 - 2*gamma) is a decreasing sequence, where d(n) is the number of divisors A000005(n) and gamma is Euler's constant A001620.A089044
Numbers n such that abs(d(n) - log(n) + 1 - 2*gamma) is a decreasing sequence, where d(n) is the number of divisors A000005(n) and gamma is Euler's constant A001620.
- a(n) = a(n-1) + (-1)^floor(n/2)*a(floor(n/2)) with a(1) = 1.A089045
a(n) = a(n-1) + (-1)^floor(n/2)*a(floor(n/2)) with a(1) = 1.
- Least edge-length of a square dissectable into at least n squares in the Mrs. Perkins's quilt problem.A089046
Least edge-length of a square dissectable into at least n squares in the Mrs. Perkins's quilt problem.
- Edge length of largest square dissectable into up to n squares in Mrs. Perkins's quilt problem.A089047
Edge length of largest square dissectable into up to n squares in Mrs. Perkins's quilt problem.
- Number of ways of writing n as a sum of exactly 3 powers of 2.A089048
Number of ways of writing n as a sum of exactly 3 powers of 2.
- Number of ways of writing n as a sum of exactly 4 powers of 2.A089049
Number of ways of writing n as a sum of exactly 4 powers of 2.
- Number of ways of writing n as a sum of exactly 5 powers of 2.A089050
Number of ways of writing n as a sum of exactly 5 powers of 2.
- Number of ways of writing n as a sum of exactly 6 powers of 2.A089051
Number of ways of writing n as a sum of exactly 6 powers of 2.
- Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) = number of partitions of n into exactly k powers of 2.A089052
Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) = number of partitions of n into exactly k powers of 2.
- Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2.A089053
Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = number of partitions of n into exactly k powers of 2.
- Solution to the non-squashing boxes problem (version 1).A089054
Solution to the non-squashing boxes problem (version 1).
- Solution to the non-squashing boxes problem (version 2).A089055
Solution to the non-squashing boxes problem (version 2).
- Primes whose sum of digits [s(d)] is a prime and where sum of two such consecutive s(d) values is a square.A089056
Primes whose sum of digits [s(d)] is a prime and where sum of two such consecutive s(d) values is a square.
- n! divided by prime whose index is the integer part of log(n).A089057
n! divided by prime whose index is the integer part of log(n).
- Each positive number x is repeated m times, where there are m numbers y >= x such that x*y/(x+y) is an integer.A089058
Each positive number x is repeated m times, where there are m numbers y >= x such that x*y/(x+y) is an integer.
- Numbers x such that xy/(x+y) is an integer and the hypotenuse of the right triangle with legs x and y is an integer.A089059
Numbers x such that xy/(x+y) is an integer and the hypotenuse of the right triangle with legs x and y is an integer.
- x = non-multiple of 7 such that xy/(x+y) is an integer and the hypotenuse of the right triangle with legs x and y is an integer.A089060
x = non-multiple of 7 such that xy/(x+y) is an integer and the hypotenuse of the right triangle with legs x and y is an integer.