Sequences
392,541 sequences
- Numbers k such that 95^k - 94^k is prime.A062661
Numbers k such that 95^k - 94^k is prime.
- Numbers k such that 96^k - 95^k is prime.A062662
Numbers k such that 96^k - 95^k is prime.
- Numbers k such that 97^k - 96^k is a strong pseudoprime.A062663
Numbers k such that 97^k - 96^k is a strong pseudoprime.
- Composite and every divisor (except for 1) contains the digit 2.A062664
Composite and every divisor (except for 1) contains the digit 2.
- Numbers k such that 99^k - 98^k is prime.A062665
Numbers k such that 99^k - 98^k is prime.
- Numbers k such that 100^k - 99^k is prime.A062666
Numbers k such that 100^k - 99^k is prime.
- Every divisor (except 1) contains the digit 3.A062667
Every divisor (except 1) contains the digit 3.
- Composite and every divisor (except 1) contains the digit 3.A062668
Composite and every divisor (except 1) contains the digit 3.
- Every divisor (except 1) contains the digit 4.A062669
Every divisor (except 1) contains the digit 4.
- Composite and every divisor (except 1) contains the digit 4.A062670
Composite and every divisor (except 1) contains the digit 4.
- Every divisor (except 1) contains the digit 5.A062671
Every divisor (except 1) contains the digit 5.
- Composite and every divisor (except 1) contains the digit 5.A062672
Composite and every divisor (except 1) contains the digit 5.
- Every divisor (except 1) contains the digit 6.A062673
Every divisor (except 1) contains the digit 6.
- Composite and every divisor (except 1) contains the digit 6.A062674
Composite and every divisor (except 1) contains the digit 6.
- Every divisor (except 1) contains the digit 7.A062675
Every divisor (except 1) contains the digit 7.
- Composite and every divisor (except 1) contains the digit 7.A062676
Composite and every divisor (except 1) contains the digit 7.
- Numbers with property that every divisor (except 1) contains the digit 8.A062677
Numbers with property that every divisor (except 1) contains the digit 8.
- Composite and every divisor (except 1) contains the digit 8.A062678
Composite and every divisor (except 1) contains the digit 8.
- Numbers such that every divisor (except 1, but including the number itself) contains the digit 9.A062679
Numbers such that every divisor (except 1, but including the number itself) contains the digit 9.
- Composite numbers whose divisors (except 1) all contain the digit 9.A062680
Composite numbers whose divisors (except 1) all contain the digit 9.
- Numbers that are sums of 2 or more consecutive squares in more than 1 way.A062681
Numbers that are sums of 2 or more consecutive squares in more than 1 way.
- Numbers that are sums of two or more consecutive (positive) cubes in more than 1 way.A062682
Numbers that are sums of two or more consecutive (positive) cubes in more than 1 way.
- Numbers that are products of all rotations of some number.A062683
Numbers that are products of all rotations of some number.
- Number of addition triangles with apex n (version 1).A062684
Number of addition triangles with apex n (version 1).
- Smallest square with digit sum n (or 0 if no such square exists).A062685
Smallest square with digit sum n (or 0 if no such square exists).
- Smallest cube with digit sum n (or 0 if no such cube exists).A062686
Smallest cube with digit sum n (or 0 if no such cube exists).
- Numbers all of whose divisors are palindromic.A062687
Numbers all of whose divisors are palindromic.
- Smallest triangular number with digit sum n (or 0 if no such number exists).A062688
Smallest triangular number with digit sum n (or 0 if no such number exists).
- Smallest square that contains the digits of n in its exact middle.A062689
Smallest square that contains the digits of n in its exact middle.
- Smallest triangular number that contains the string n in its exact center.A062690
Smallest triangular number that contains the string n in its exact center.
- Triangular numbers that contain exactly 2 different digits.A062691
Triangular numbers that contain exactly 2 different digits.
- Number of irreducible polynomials over F_2 of degree at most n.A062692
Number of irreducible polynomials over F_2 of degree at most n.
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.A062693
Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3.
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3 and nontrivial SHA[2].A062694
Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 3 and nontrivial SHA[2].
- Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 2.A062695
Squarefree n such that the elliptic curve n*y^2 = x^3 - x arising in the "congruent number" problem has rank 2.
- Palindromes that are the sum of two shorter palindromes.A062696
Palindromes that are the sum of two shorter palindromes.
- Palindromes > 10 that are the sum of two distinct smaller palindromes.A062697
Palindromes > 10 that are the sum of two distinct smaller palindromes.
- Primes of form 2*k! + 1.A062698
Primes of form 2*k! + 1.
- Numbers n such that sigma(n) = 2*phi(n).A062699
Numbers n such that sigma(n) = 2*phi(n).
- Terms of A000203 that are prime.A062700
Terms of A000203 that are prime.
- Index of factorial primes of the form k! + 1.A062701
Index of factorial primes of the form k! + 1.
- Index of factorial primes of form m!-1.A062702
Index of factorial primes of form m!-1.
- Squares that are the sum of two consecutive primes.A062703
Squares that are the sum of two consecutive primes.
- Di-Boustrophedon transform of all 1's sequence: Fill in an array by diagonals alternating in the 'up' and 'down' directions. Each diagonal starts with a 1. When going in the 'up' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the row the new element is in. When going in the 'down' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the column the new element is in. The final element of the n-th diagonal is a(n).A062704
Di-Boustrophedon transform of all 1's sequence: Fill in an array by diagonals alternating in the 'up' and 'down' directions. Each diagonal starts with a 1. When going in the 'up' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the row the new element is in. When going in the 'down' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the column the new element is in. The final element of the n-th diagonal is a(n).
- Array described in A062704 read by diagonals in direction of creation.A062705
Array described in A062704 read by diagonals in direction of creation.
- The array of A062704 read by diagonals in the 'up' direction.A062706
The array of A062704 read by diagonals in the 'up' direction.
- Table by antidiagonals of n*k*(k+1)/2.A062707
Table by antidiagonals of n*k*(k+1)/2.
- Write 0,1,2,3,4,... in a triangular spiral; then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0,2,...A062708
Write 0,1,2,3,4,... in a triangular spiral; then a(n) is the sequence found by reading the terms along the line from 0 in the direction 0,2,...
- a(n) = 2^n + 3.A062709
a(n) = 2^n + 3.
- Number of cyclic subgroups of general affine group over GF(2), AGL(n,2).A062710
Number of cyclic subgroups of general affine group over GF(2), AGL(n,2).