Sequences
392,541 sequences
- Sum of members of n-th group in A076062 divided by n-th prime.A076061
Sum of members of n-th group in A076062 divided by n-th prime.
- Group the positive integers so that the n-th group contains n numbers whose sum is a multiple of the n-th prime.A076062
Group the positive integers so that the n-th group contains n numbers whose sum is a multiple of the n-th prime.
- Group the natural numbers so that the n-th group contains n numbers whose sum is a multiple of the n-th composite number.A076063
Group the natural numbers so that the n-th group contains n numbers whose sum is a multiple of the n-th composite number.
- Initial members of groups in A076063.A076064
Initial members of groups in A076063.
- Final members of groups in A076063.A076065
Final members of groups in A076063.
- Sums of members of groups in A076063.A076066
Sums of members of groups in A076063.
- Sum of members of n-th group in A076063 divided by n-th composite number.A076067
Sum of members of n-th group in A076063 divided by n-th composite number.
- Smallest number that can be formed by using the nonzero digits of the numbers 1+n(n-1)/2 through n(n+1)/2.A076068
Smallest number that can be formed by using the nonzero digits of the numbers 1+n(n-1)/2 through n(n+1)/2.
- Largest number formed as concatenation of a permutation of the n consecutive numbers 1+n(n-1)/2, ..., n(n+1)/2 (written in decimal).A076069
Largest number formed as concatenation of a permutation of the n consecutive numbers 1+n(n-1)/2, ..., n(n+1)/2 (written in decimal).
- Smallest multiple of n that can be formed by using the digits of the next n numbers, or 0 if no such number exists.A076070
Smallest multiple of n that can be formed by using the digits of the next n numbers, or 0 if no such number exists.
- a(n) = A076070(n)/n.A076071
a(n) = A076070(n)/n.
- Largest multiple of n that can be formed by using the digits of the next n numbers, or 0 if no such number exists.A076072
Largest multiple of n that can be formed by using the digits of the next n numbers, or 0 if no such number exists.
- a(n) = A076072(n)/n.A076073
a(n) = A076072(n)/n.
- Initial members of groups in A076077.A076074
Initial members of groups in A076077.
- Final members of groups in A076077.A076075
Final members of groups in A076077.
- Primes associated with groups in A076077.A076076
Primes associated with groups in A076077.
- Group the natural numbers so that the n-th group contains n numbers, the k-th number in a group is a multiple of k and the sum of the group is prime: (2), (1, 4), (3, 8, 6), (5, 10, 12, 16), (7, 14, 9, 24, 25), ...A076077
Group the natural numbers so that the n-th group contains n numbers, the k-th number in a group is a multiple of k and the sum of the group is prime: (2), (1, 4), (3, 8, 6), (5, 10, 12, 16), (7, 14, 9, 24, 25), ...
- a(n) is the number of nonempty sets of distinct positive integers that have a least common multiple of n.A076078
a(n) is the number of nonempty sets of distinct positive integers that have a least common multiple of n.
- Largest multiple of n < the n-th prime.A076079
Largest multiple of n < the n-th prime.
- a(n) = A076079(n)/n.A076080
a(n) = A076079(n)/n.
- Rearrange numbers from 1 to n: start with the divisors of n in ascending order followed by numbers in ascending order which leave a remainder 1 on dividing by n, followed by those leaving remainder 2 ... up to remainder [(n-1)/2].A076081
Rearrange numbers from 1 to n: start with the divisors of n in ascending order followed by numbers in ascending order which leave a remainder 1 on dividing by n, followed by those leaving remainder 2 ... up to remainder [(n-1)/2].
- Consider all composite numbers between prime(n) and prime(n+1); take those with greatest number of divisors; a(n) is the smallest of them.A076082
Consider all composite numbers between prime(n) and prime(n+1); take those with greatest number of divisors; a(n) is the smallest of them.
- Consider all composite numbers between prime(n) and prime(n+1); take those with smallest number of divisors; a(n) is the smallest of them.A076083
Consider all composite numbers between prime(n) and prime(n+1); take those with smallest number of divisors; a(n) is the smallest of them.
- Consider all numbers that can be formed by permuting the digits of n; take those with the greatest number of divisors; a(n) is the smallest of them.A076084
Consider all numbers that can be formed by permuting the digits of n; take those with the greatest number of divisors; a(n) is the smallest of them.
- Duplicate of A074164.A076085
Duplicate of A074164.
- a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).A076086
a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).
- a(n) = 7*n - 3 * Sum_{i=1..n} A006460(i).A076087
a(n) = 7*n - 3 * Sum_{i=1..n} A006460(i).
- Duplicate of A061211.A076088
Duplicate of A061211.
- Essentially a duplicate of A046000.A076089
Essentially a duplicate of A046000.
- a(1) = 1; for n > 1, smallest number > 1 which is the n-th power of the sum of its digits, or 0 if no such number exists.A076090
a(1) = 1; for n > 1, smallest number > 1 which is the n-th power of the sum of its digits, or 0 if no such number exists.
- Numbers n such that A064097(n) - A003313(n) = 1.A076091
Numbers n such that A064097(n) - A003313(n) = 1.
- a(n) = n - 2*Sum_{i=1..n} A076182(i).A076092
a(n) = n - 2*Sum_{i=1..n} A076182(i).
- Squares arising in A076991.A076093
Squares arising in A076991.
- First n-digit prime encountered in decimal expansion of Pi (ignoring the initial 3).A076094
First n-digit prime encountered in decimal expansion of Pi (ignoring the initial 3).
- Initial terms of rows in A076099.A076095
Initial terms of rows in A076099.
- Final terms of rows in A076099.A076096
Final terms of rows in A076099.
- Products of rows in A076099.A076097
Products of rows in A076099.
- Geometric mean of n-th row in A076099.A076098
Geometric mean of n-th row in A076099.
- Triangle read by rows in which the n-th row contains n numbers not occurring in the previous rows whose product is an n-th power. The first (n-1) numbers of the n-th row are the smallest number not occurring earlier and the n-th term is chosen to satisfy the requirement.A076099
Triangle read by rows in which the n-th row contains n numbers not occurring in the previous rows whose product is an n-th power. The first (n-1) numbers of the n-th row are the smallest number not occurring earlier and the n-th term is chosen to satisfy the requirement.
- Least common multiple of n numbers starting with n.A076100
Least common multiple of n numbers starting with n.
- Initial members of groups in A076105.A076101
Initial members of groups in A076105.
- Final members of groups in A076105.A076102
Final members of groups in A076105.
- Sums of members of groups in A076105.A076103
Sums of members of groups in A076105.
- Ratios of sums of successive groups in A076105.A076104
Ratios of sums of successive groups in A076105.
- a(1)=1 (first row) and then the n-th row of this triangle contains the least set of n unused natural numbers whose sum is a multiple of the sum of the previous row.A076105
a(1)=1 (first row) and then the n-th row of this triangle contains the least set of n unused natural numbers whose sum is a multiple of the sum of the previous row.
- Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is a(n), and it appears at position A076130(n).A076106
Out of all the n-digit primes, which one takes the longest time to appear in the digits of Pi (ignoring the initial 3)? The answer is a(n), and it appears at position A076130(n).
- First of n consecutive integers whose sum is a positive n-th power, or 0 if no such integers exist.A076107
First of n consecutive integers whose sum is a positive n-th power, or 0 if no such integers exist.
- Least positive n-th power that is the sum of n consecutive integers, or 0 if no such n-th power exists.A076108
Least positive n-th power that is the sum of n consecutive integers, or 0 if no such n-th power exists.
- Least positive k such that k^n is the sum of n consecutive integers, or 0 if no such k exists.A076109
Least positive k such that k^n is the sum of n consecutive integers, or 0 if no such k exists.
- Triangle (read by rows) in which the n-th row contains first n terms of an arithmetic progression with first term 1 and common difference (n-1).A076110
Triangle (read by rows) in which the n-th row contains first n terms of an arithmetic progression with first term 1 and common difference (n-1).