Sequences
392,541 sequences
- a(n) = (concatenation of the first n terms of A099552)/n.A083161
a(n) = (concatenation of the first n terms of A099552)/n.
- a(n) is the smallest unused proper divisor or proper multiple of n such that a(n)/n != a(m)/m for all m < n.A083162
a(n) is the smallest unused proper divisor or proper multiple of n such that a(n)/n != a(m)/m for all m < n.
- Define a function f(k) by f(k) = (k*a*b*c...)/(d*e*f...), where a,b,c,...are those nonzero digits of k which do not divide k and d,e,f,... are those nonzero digits of k which divide k. a(n) = Floor[f(k)].A083163
Define a function f(k) by f(k) = (k*a*b*c...)/(d*e*f...), where a,b,c,...are those nonzero digits of k which do not divide k and d,e,f,... are those nonzero digits of k which divide k. a(n) = Floor[f(k)].
- Rearrangement of natural numbers such that n divides sum of the terms with index which are the divisors of n.A083164
Rearrangement of natural numbers such that n divides sum of the terms with index which are the divisors of n.
- a(n) = (Sum of the terms of A083164 with index which are the divisors of n ) /n.A083165
a(n) = (Sum of the terms of A083164 with index which are the divisors of n ) /n.
- Fixed points of A083164: numbers k such that A083164(k) = k.A083166
Fixed points of A083164: numbers k such that A083164(k) = k.
- Triangle read by rows in which from the second row onwards the n-th row contains n smallest multiples of (n-1) not included earlier such that the row sum is a multiple of n. Triangle begins with 1.A083167
Triangle read by rows in which from the second row onwards the n-th row contains n smallest multiples of (n-1) not included earlier such that the row sum is a multiple of n. Triangle begins with 1.
- Diagonal of A083167.A083168
Diagonal of A083167.
- First column of A083167.A083169
First column of A083167.
- Row sums in A083167.A083170
Row sums in A083167.
- a(n) = the arithmetic mean of the n-th row of triangle A083167.A083171
a(n) = the arithmetic mean of the n-th row of triangle A083167.
- Triangle read by rows: T(1, 1) = 1 and for n > 1, T(n, k) = A083167(n, k)/(n-1).A083172
Triangle read by rows: T(1, 1) = 1 and for n > 1, T(n, k) = A083167(n, k)/(n-1).
- Triangle read by rows: the n-th row contains the first n-1 multiples of prime(n) followed by the next multiple that will make the row sum a multiple of n.A083173
Triangle read by rows: the n-th row contains the first n-1 multiples of prime(n) followed by the next multiple that will make the row sum a multiple of n.
- Leading diagonal of A083173.A083174
Leading diagonal of A083173.
- Row sums in A083175.A083175
Row sums in A083175.
- Arithmetic means of rows of A083173.A083176
Arithmetic means of rows of A083173.
- Let P(k) = floor(k/2). Start with n, apply P repeatedly until reach 1. a(n) = concatenation of numbers obtained.A083177
Let P(k) = floor(k/2). Start with n, apply P repeatedly until reach 1. a(n) = concatenation of numbers obtained.
- Numbers with a digit sum of n and a maximum product of digits. In case of two identical products choose the largest number.A083178
Numbers with a digit sum of n and a maximum product of digits. In case of two identical products choose the largest number.
- a(1)=1, a(n) = smallest positive integer not included earlier such that the partial sums of a(A000040) are prime and the partial sums of a(A002808) are composite.A083179
a(1)=1, a(n) = smallest positive integer not included earlier such that the partial sums of a(A000040) are prime and the partial sums of a(A002808) are composite.
- Numbers which retain their natural position under the rearrangement of A083179.A083180
Numbers which retain their natural position under the rearrangement of A083179.
- a(1)=1, a(n) = smallest positive integer not included earlier such that the partial sums of a(A000040) are composite and the partial sums of a(A002808) are primes.A083181
a(1)=1, a(n) = smallest positive integer not included earlier such that the partial sums of a(A000040) are composite and the partial sums of a(A002808) are primes.
- Greatest 3-brilliant number of size n.A083182
Greatest 3-brilliant number of size n.
- Smallest palindromic prime using only prime digits (2,3,5,7) and having a sum of digits = prime(n), or 0 if no such number exists.A083183
Smallest palindromic prime using only prime digits (2,3,5,7) and having a sum of digits = prime(n), or 0 if no such number exists.
- Smallest palindromic prime having a sum of digits = prime(n), or 0 if no such number exists.A083184
Smallest palindromic prime having a sum of digits = prime(n), or 0 if no such number exists.
- Palindromic primes using only nonprime digits (0,1,4,6,8,9).A083185
Palindromic primes using only nonprime digits (0,1,4,6,8,9).
- Sum of the first n primes whose indices are primes.A083186
Sum of the first n primes whose indices are primes.
- a(n) = floor(log_3/2(n+1)) - floor(log_3/2(n)).A083187
a(n) = floor(log_3/2(n+1)) - floor(log_3/2(n)).
- Lexicographically earliest sequence of distinct primes with the property that for all n >= 1, the concatenation of a(n), a(n+1), ..., a(2n-1) is a prime.A083188
Lexicographically earliest sequence of distinct primes with the property that for all n >= 1, the concatenation of a(n), a(n+1), ..., a(2n-1) is a prime.
- Primes arising in A083188.A083189
Primes arising in A083188.
- a(1) = 1; for n>1 a(n) is smallest prime not occurring earlier such that the concatenation of a(n), a(n+1), ..., a(2n-1) is a composite number.A083190
a(1) = 1; for n>1 a(n) is smallest prime not occurring earlier such that the concatenation of a(n), a(n+1), ..., a(2n-1) is a composite number.
- Composite numbers arising in A083190.A083191
Composite numbers arising in A083190.
- a(1) = 1, then the rearrangement of composite numbers such that the concatenation of n terms from the n-th term is a prime. (Concatenation of n-th term to (2n-1)th term is a prime number).A083192
a(1) = 1, then the rearrangement of composite numbers such that the concatenation of n terms from the n-th term is a prime. (Concatenation of n-th term to (2n-1)th term is a prime number).
- a(1) = 1 and then primes arising in A083192. Concatenation of n-th term to (2n-1)-th term of A083192.A083193
a(1) = 1 and then primes arising in A083192. Concatenation of n-th term to (2n-1)-th term of A083192.
- Erroneous version of A075618.A083194
Erroneous version of A075618.
- Multiples of n obtained as the concatenation of terms A075618(n) to A075618(2n-1).A083195
Multiples of n obtained as the concatenation of terms A075618(n) to A075618(2n-1).
- a(n) = 8*n^4 + 9*n^2 + 2.A083196
a(n) = 8*n^4 + 9*n^2 + 2.
- Triangular array, read by rows, where if n is odd the n-th row consists of n least unused nonprimes, while if n is even the n-th row consists of the n least unused primes.A083197
Triangular array, read by rows, where if n is odd the n-th row consists of n least unused nonprimes, while if n is even the n-th row consists of the n least unused primes.
- a(n) = A061419(n) - A002379(n).A083198
a(n) = A061419(n) - A002379(n).
- Exponent of largest power of 2 dividing A061419(n).A083199
Exponent of largest power of 2 dividing A061419(n).
- Polynexus numbers of order 7.A083200
Polynexus numbers of order 7.
- a(1) = 1. For n>1, let x = a(n-1)+1; then a(n) is the first prime in the sequence 2*x-1, 2*x-3, 4*x-1, 4*x-3, 8*x-1, 8*x-3, ..., (2^k)*x-1, (2^k)*x-3, ...A083201
a(1) = 1. For n>1, let x = a(n-1)+1; then a(n) is the first prime in the sequence 2*x-1, 2*x-3, 4*x-1, 4*x-3, 8*x-1, 8*x-3, ..., (2^k)*x-1, (2^k)*x-3, ...
- a(n) = gcd(A000055(n), A000055(n+1)).A083202
a(n) = gcd(A000055(n), A000055(n+1)).
- a(1) = 1, then smallest number not included earlier such that a(n)*a(n+1) + 1 is a cube.A083203
a(1) = 1, then smallest number not included earlier such that a(n)*a(n+1) + 1 is a cube.
- Bases for the cubes arising in A083203.A083204
Bases for the cubes arising in A083203.
- a(1) = 1, then smallest number not included earlier such that a(n)*a(n+1) + 1 is an n-th power.A083205
a(1) = 1, then smallest number not included earlier such that a(n)*a(n+1) + 1 is an n-th power.
- a(n) is the number of ways of partitioning the divisors of n into two disjoint sets with equal sum.A083206
a(n) is the number of ways of partitioning the divisors of n into two disjoint sets with equal sum.
- Zumkeller or integer-perfect numbers: numbers n whose divisors can be partitioned into two disjoint sets with equal sum.A083207
Zumkeller or integer-perfect numbers: numbers n whose divisors can be partitioned into two disjoint sets with equal sum.
- a(n) = A083206(A083207(n)).A083208
a(n) = A083206(A083207(n)).
- Numbers whose divisors can be partitioned in exactly one way into two disjoint sets with the same sum.A083209
Numbers whose divisors can be partitioned in exactly one way into two disjoint sets with the same sum.
- Numbers with no subset of their divisors such that the complement has the same sum.A083210
Numbers with no subset of their divisors such that the complement has the same sum.