Sequences
392,541 sequences
- Zigzag matrices listed entry by entry.A088961
Zigzag matrices listed entry by entry.
- Values of n that generate Generalized Gaussian-Mersenne primes (see below).A088962
Values of n that generate Generalized Gaussian-Mersenne primes (see below).
- Primes p such that 5p is the hypotenuse belonging to two prime-free primitive Pythagorean triples.A088963
Primes p such that 5p is the hypotenuse belonging to two prime-free primitive Pythagorean triples.
- Number of solutions to x^2 == 2y^2 (mod n).A088964
Number of solutions to x^2 == 2y^2 (mod n).
- Number of solutions to x^2 + 2y^2 == 1 (mod n).A088965
Number of solutions to x^2 + 2y^2 == 1 (mod n).
- Numbers k such that A007947(k) = A007947(m+1) and A007947(m) = A007947(k+1), where k > m.A088966
Numbers k such that A007947(k) = A007947(m+1) and A007947(m) = A007947(k+1), where k > m.
- Numbers n such that n+9 is a prime.A088967
Numbers n such that n+9 is a prime.
- a(n) is the number of consecutive primes x-3,x+3 such that x=j*(p(n)#/3)/p(k), where 1 <= j < p(n+1) and 3 <= k <= n and p(k) doesn't divide j.A088968
a(n) is the number of consecutive primes x-3,x+3 such that x=j*(p(n)#/3)/p(k), where 1 <= j < p(n+1) and 3 <= k <= n and p(k) doesn't divide j.
- Triangle T(n,k), read by rows, given by A000290 DELTA [1, 2, 6, 5, 11, 8, 16, 11, 21, 14, 26, 17, 31, 20, 36, ...] where DELTA is the operator defined in A084938.A088969
Triangle T(n,k), read by rows, given by A000290 DELTA [1, 2, 6, 5, 11, 8, 16, 11, 21, 14, 26, 17, 31, 20, 36, ...] where DELTA is the operator defined in A084938.
- Duplicate of A068425.A088970
Duplicate of A068425.
- Number of twin prime pairs between consecutive prime-indexed primes of order 3. The bounds are included in the calculation.A088971
Number of twin prime pairs between consecutive prime-indexed primes of order 3. The bounds are included in the calculation.
- Triangle read by rows: colored polyominoes. For n >= 1, 1 <= k <= n, T(n, k) is the number of k-colored n-celled polyominoes, counted up to rotation, reflection and permutation of the colors. Adjacent cells must be different colors. T(n, k) counts only polyominoes that include all k colors.A088972
Triangle read by rows: colored polyominoes. For n >= 1, 1 <= k <= n, T(n, k) is the number of k-colored n-celled polyominoes, counted up to rotation, reflection and permutation of the colors. Adjacent cells must be different colors. T(n, k) counts only polyominoes that include all k colors.
- Number of twin prime pairs between consecutive prime-indexed primes of order 4. The bounds are included in the calculation.A088973
Number of twin prime pairs between consecutive prime-indexed primes of order 4. The bounds are included in the calculation.
- Number of (nonisomorphic) connected bipartite graphs with minimum degree at least 2 and with n vertices.A088974
Number of (nonisomorphic) connected bipartite graphs with minimum degree at least 2 and with n vertices.
- Breadth-first traversal of the Collatz tree, with the odd child of each node traversed prior to its even child. If the Collatz 3n+1 conjecture is true, this is a permutation of all positive integers.A088975
Breadth-first traversal of the Collatz tree, with the odd child of each node traversed prior to its even child. If the Collatz 3n+1 conjecture is true, this is a permutation of all positive integers.
- Breadth-first traversal of the Collatz tree, with the even child of each node traversed prior to its odd child. If the Collatz 3n+1 conjecture is true, this is a permutation of all positive integers.A088976
Breadth-first traversal of the Collatz tree, with the even child of each node traversed prior to its odd child. If the Collatz 3n+1 conjecture is true, this is a permutation of all positive integers.
- Side of primitive equilateral triangle with prime cevian p=A002476(n) cutting an edge into two integral parts.A088977
Side of primitive equilateral triangle with prime cevian p=A002476(n) cutting an edge into two integral parts.
- Number of Pythagorean triangles having the n-th prime prime(n) as one of their sides.A088978
Number of Pythagorean triangles having the n-th prime prime(n) as one of their sides.
- a(n) = n! - ((n-1)!!)^2.A088979
a(n) = n! - ((n-1)!!)^2.
- G.f.: 1 + x + Sum_{n >= 1} ( x^(2^n)/ ((1+x^(2^(n-1)))*Product_{j=0..n-1} (1-x^(2^j)) ) ).A088980
G.f.: 1 + x + Sum_{n >= 1} ( x^(2^n)/ ((1+x^(2^(n-1)))*Product_{j=0..n-1} (1-x^(2^j)) ) ).
- a(n+2) = a(n+1) + a(n) - (2*n + 1) where a(0)=7, a(1)=11.A088981
a(n+2) = a(n+1) + a(n) - (2*n + 1) where a(0)=7, a(1)=11.
- Primes that are between consecutive prime-indexed primes.A088982
Primes that are between consecutive prime-indexed primes.
- Numbers k such that each of the 6 consecutive numbers k through k+5 has exactly two distinct prime factors.A088983
Numbers k such that each of the 6 consecutive numbers k through k+5 has exactly two distinct prime factors.
- a(n) = (n!!)^2 - n!.A088984
a(n) = (n!!)^2 - n!.
- Numbers of the form prime(prime(n)+1), with n satisfying prime(n)+2 = prime(n+1).A088985
Numbers of the form prime(prime(n)+1), with n satisfying prime(n)+2 = prime(n+1).
- Numbers k such that each of k through k+4 are divisible by exactly two primes.A088986
Numbers k such that each of k through k+4 are divisible by exactly two primes.
- Triples of primes between two consecutive prime-indexed primes.A088987
Triples of primes between two consecutive prime-indexed primes.
- Least prime that begins a run of exactly 2n-1 primes between two consecutive prime-indexed primes.A088988
Least prime that begins a run of exactly 2n-1 primes between two consecutive prime-indexed primes.
- Denominators of coefficients of odd powers of 1/q in the solution series for Tan[x]/x=1.A088989
Denominators of coefficients of odd powers of 1/q in the solution series for Tan[x]/x=1.
- Triangle related to generalized Euler numbers of type 2^n (A005799).A088990
Triangle related to generalized Euler numbers of type 2^n (A005799).
- Derangement numbers d(n,4) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.A088991
Derangement numbers d(n,4) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.
- Derangement numbers d(n,5) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.A088992
Derangement numbers d(n,5) where d(n,k) = k(n-1)(d(n-1,k) + d(n-2,k)), with d(0,k) = 1 and d(1,k) = 0.
- Primes such that exactly five of them occur between consecutive prime-indexed primes.A088993
Primes such that exactly five of them occur between consecutive prime-indexed primes.
- Number of permutations in the symmetric group S_n such that the size of their centralizer is odd.A088994
Number of permutations in the symmetric group S_n such that the size of their centralizer is odd.
- Least k > 0 such that the first n digits of 2^k and 5^k are identical.A088995
Least k > 0 such that the first n digits of 2^k and 5^k are identical.
- Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.A088996
Triangle T(n, k) read by rows: T(n, k) = Sum_{j=0..n} binomial(j, n-k) * |Stirling1(n, n-j)|.
- Base-10 numbers such that a(n) plus any nonnegative palindrome less than a(n) does not yield a palindrome.A088997
Base-10 numbers such that a(n) plus any nonnegative palindrome less than a(n) does not yield a palindrome.
- Flip 6,9 primes.A088998
Flip 6,9 primes.
- Flip 6,9 numbers: if number k contains decimal digit '6' or '9', then flip all occurrences of '6' to '9' and vice versa.A088999
Flip 6,9 numbers: if number k contains decimal digit '6' or '9', then flip all occurrences of '6' to '9' and vice versa.
- Square table, read by antidiagonals, of coefficients T(k,n) (row k; column n) defined by: T(k,n) = k*T(k,n-1)+ n; T(k,0) = 0.A089000
Square table, read by antidiagonals, of coefficients T(k,n) (row k; column n) defined by: T(k,n) = k*T(k,n-1)+ n; T(k,0) = 0.
- Numbers n such that 2*n^2 + 1 is prime.A089001
Numbers n such that 2*n^2 + 1 is prime.
- Number of non-congruent solutions to x^2 + 2y^2 == -1 (mod n).A089002
Number of non-congruent solutions to x^2 + 2y^2 == -1 (mod n).
- Number of non-congruent solutions to x^2 - 2y^2 == 1 (mod n).A089003
Number of non-congruent solutions to x^2 - 2y^2 == 1 (mod n).
- Number of partitions of an n-element set that have at least one odd block.A089004
Number of partitions of an n-element set that have at least one odd block.
- Number of partitions of n-set with at least one even block.A089005
Number of partitions of n-set with at least one even block.
- Number of distinct n X n (0,1) matrices after double sorting: by row, by column, by row .. until reaching a fixed point.A089006
Number of distinct n X n (0,1) matrices after double sorting: by row, by column, by row .. until reaching a fixed point.
- Sequence of primes p(n) such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3, 2*p(n+3)+3 are four consecutive primes, where p(i) denotes the i-th prime.A089007
Sequence of primes p(n) such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3, 2*p(n+3)+3 are four consecutive primes, where p(i) denotes the i-th prime.
- Numbers k such that 18*k^2 + 1 is prime.A089008
Numbers k such that 18*k^2 + 1 is prime.
- Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3, 2*p(n+3)+3 are consecutive primes, where p(i) denotes the i-th prime.A089009
Numbers n such that 2*p(n)+3, 2*p(n+1)+3, 2*p(n+2)+3, 2*p(n+3)+3 are consecutive primes, where p(i) denotes the i-th prime.
- a(n) = 1 if n is an exponent of the Weyl group W(E_8), 0 otherwise.A089010
a(n) = 1 if n is an exponent of the Weyl group W(E_8), 0 otherwise.