Sequences
392,541 sequences
- Primes arising in A083760.A083761
Primes arising in A083760.
- Rearrangement of natural numbers such that concatenation of terms beginning with the first one with a 1 as the least significant digit is a prime.A083762
Rearrangement of natural numbers such that concatenation of terms beginning with the first one with a 1 as the least significant digit is a prime.
- Primes arising in A083762.A083763
Primes arising in A083762.
- n-th row of the following triangle contains n palindromic multiples of n beginning with n. Sequence contains the triangle by rows.A083764
n-th row of the following triangle contains n palindromic multiples of n beginning with n. Sequence contains the triangle by rows.
- Diagonal of A083764.A083765
Diagonal of A083764.
- Row sums of A083764.A083766
Row sums of A083764.
- Sum of n-th row of A083764 divided by n.A083767
Sum of n-th row of A083764 divided by n.
- Triangle formed by dividing row n of A083764 by n.A083768
Triangle formed by dividing row n of A083764 by n.
- a(1)=2; for n >= 2, a(n) = smallest even number such that a(1)*a(2)*...*a(n) + 1 is prime.A083769
a(1)=2; for n >= 2, a(n) = smallest even number such that a(1)*a(2)*...*a(n) + 1 is prime.
- Primes arising in A083769.A083770
Primes arising in A083769.
- Rearrangement of primes such that every partial product + 1 is a prime.A083771
Rearrangement of primes such that every partial product + 1 is a prime.
- Primes arising in A083771.A083772
Primes arising in A083771.
- The n-th row of the following triangle contains n distinct numbers such that the product of (n-1) of them + 1 is always a prime. The first (n-1) numbers are the smallest set whose product +1 is a prime and the n-th term is chosen to satisfy the requirement. a(1) = 1 by convention. Sequence contains the triangle by rows.A083773
The n-th row of the following triangle contains n distinct numbers such that the product of (n-1) of them + 1 is always a prime. The first (n-1) numbers are the smallest set whose product +1 is a prime and the n-th term is chosen to satisfy the requirement. a(1) = 1 by convention. Sequence contains the triangle by rows.
- Diagonal of A083773.A083774
Diagonal of A083773.
- Triangle of primes associated with A083773.A083775
Triangle of primes associated with A083773.
- The n-th row of the following triangle contains n distinct primes such that the product of (n-1) of them + 2 is prime in all cases. The first (n-1) numbers are the smallest set whose product +2 is a prime and the n-th term is chosen to satisfy the requirement. a(1) = 2 by convention. Sequence contains the triangle by rows.A083776
The n-th row of the following triangle contains n distinct primes such that the product of (n-1) of them + 2 is prime in all cases. The first (n-1) numbers are the smallest set whose product +2 is a prime and the n-th term is chosen to satisfy the requirement. a(1) = 2 by convention. Sequence contains the triangle by rows.
- Diagonal of A083776.A083777
Diagonal of A083776.
- Triangle of primes derived in A083776.A083778
Triangle of primes derived in A083776.
- n-th row of the following triangle contains n even numbers such that every sum of n-1 of them + 1 is a prime. Sequence contains the triangle by rows.A083779
n-th row of the following triangle contains n even numbers such that every sum of n-1 of them + 1 is a prime. Sequence contains the triangle by rows.
- Diagonal of A083779.A083780
Diagonal of A083779.
- Triangle of primes associated with A083779.A083781
Triangle of primes associated with A083779.
- n-th row of the following triangle contains n distinct natural numbers such that every sum of n-1 of them +1 is a prime, n>1, with a(1) = 1 by convention. Sequence contains the triangle by rows.A083782
n-th row of the following triangle contains n distinct natural numbers such that every sum of n-1 of them +1 is a prime, n>1, with a(1) = 1 by convention. Sequence contains the triangle by rows.
- Diagonal of A083782.A083783
Diagonal of A083782.
- Triangle of primes derived from A083782.A083784
Triangle of primes derived from A083782.
- Triangle read by rows in which the n-th row gives the smallest set of n consecutive numbers with the same prime signatures.A083785
Triangle read by rows in which the n-th row gives the smallest set of n consecutive numbers with the same prime signatures.
- Composite numbers mod 10.A083786
Composite numbers mod 10.
- Sequence contains the prime signature pertaining to the n-th row of A083785.A083787
Sequence contains the prime signature pertaining to the n-th row of A083785.
- Triangle read by rows, in which n-th row contains smallest set of n consecutive numbers with distinct prime signatures.A083788
Triangle read by rows, in which n-th row contains smallest set of n consecutive numbers with distinct prime signatures.
- Diagonal of A083788.A083789
Diagonal of A083788.
- Smallest start of n consecutive numbers with distinct prime signatures.A083790
Smallest start of n consecutive numbers with distinct prime signatures.
- Prime signatures pertaining to A083788.A083791
Prime signatures pertaining to A083788.
- Lexicographically first increasing sequence such that no two successive terms have the same prime signature.A083792
Lexicographically first increasing sequence such that no two successive terms have the same prime signature.
- Numbers k such that k and k-1 have the same prime signature. Numbers not included in A083792.A083793
Numbers k such that k and k-1 have the same prime signature. Numbers not included in A083792.
- Numbers k such that tau(k) is different from tau(k-1), where tau(m) = number of divisors of m.A083794
Numbers k such that tau(k) is different from tau(k-1), where tau(m) = number of divisors of m.
- Numbers k such that k and k-1 have the same number of divisors. Numbers not included in A083794.A083795
Numbers k such that k and k-1 have the same number of divisors. Numbers not included in A083794.
- Triangle read by rows in which the n-th row contains n lexicographically earliest distinct numbers such that the sum of the (n-1) terms other than the r-th term is divisible by r.A083796
Triangle read by rows in which the n-th row contains n lexicographically earliest distinct numbers such that the sum of the (n-1) terms other than the r-th term is divisible by r.
- Diagonal of A083796.A083797
Diagonal of A083796.
- Triangle obtained by replacing each term in A083796 with the sum of all other terms in that row.A083798
Triangle obtained by replacing each term in A083796 with the sum of all other terms in that row.
- Main diagonal of A083798.A083799
Main diagonal of A083798.
- First column of A083798.A083800
First column of A083798.
- Triangle read by rows obtained by replacing each term T(n,k) in A083796 with the sum, divided by r, of the other n-1 terms in the n-th row.A083801
Triangle read by rows obtained by replacing each term T(n,k) in A083796 with the sum, divided by r, of the other n-1 terms in the n-th row.
- a(n) = A083799(n)/n.A083802
a(n) = A083799(n)/n.
- Smallest number k such that the concatenations k 2n-1 and 2n-1 k are both primes, or 0 if n = 5m+3.A083803
Smallest number k such that the concatenations k 2n-1 and 2n-1 k are both primes, or 0 if n = 5m+3.
- a(1) = 1. If the (n-1)th partial concatenation is divisible by n then a(n) = 0. Otherwise, a(n) is the smallest positive number such that the n-th partial concatenation is divisible by n.A083804
a(1) = 1. If the (n-1)th partial concatenation is divisible by n then a(n) = 0. Otherwise, a(n) is the smallest positive number such that the n-th partial concatenation is divisible by n.
- n-th partial concatenation of terms of A083804 divided by n.A083805
n-th partial concatenation of terms of A083804 divided by n.
- Perfect powers using only prime digits and 1.A083806
Perfect powers using only prime digits and 1.
- Perfect powers using only composite digits 4,6,8,9 and 0.A083807
Perfect powers using only composite digits 4,6,8,9 and 0.
- Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9).A083808
Smallest prime == 1 (mod n-th unary number U(n) = (10^n-1)/9).
- Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.A083809
Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.
- a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).A083810
a(n) = f^(n) (n), where f(n) is the smallest prime == 1 mod n (cf. A034694).