Sequences
392,541 sequences
- Smallest n-digit squarefree number with maximum number of prime divisors.A074111
Smallest n-digit squarefree number with maximum number of prime divisors.
- Let omega(m) be the number of distinct prime divisors of m. Then a(n) is the largest n-digit squarefree number such that omega(n) > omega(j) for all j < n.A074112
Let omega(m) be the number of distinct prime divisors of m. Then a(n) is the largest n-digit squarefree number such that omega(n) > omega(j) for all j < n.
- Duplicate of A074116.A074113
Duplicate of A074116.
- Largest n-digit number of the form p^a*q^b... with the maximum value of a+b+.... where p, q etc. are primes.A074114
Largest n-digit number of the form p^a*q^b... with the maximum value of a+b+.... where p, q etc. are primes.
- a(n) = n!/A000793(n).A074115
a(n) = n!/A000793(n).
- Largest n-digit power of 2.A074116
Largest n-digit power of 2.
- Smallest n-digit power of 3.A074117
Smallest n-digit power of 3.
- Largest power of 3 <= 10^n.A074118
Largest power of 3 <= 10^n.
- Seventh root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).A074119
Seventh root of n contains n as a string of digits to the immediate right of the decimal point (excluding leading zeros).
- Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum of the terms in the n-th group.A074120
Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum of the terms in the n-th group.
- Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the first term in each group.A074121
Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the first term in each group.
- Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the number of terms in the n-th group.A074122
Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives the number of terms in the n-th group.
- Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives group sum divided by n for the n-th group.A074123
Group successively larger composite numbers so that the sum of the n-th group is a multiple of n. Sequence gives group sum divided by n for the n-th group.
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives sum of n-th group.A074124
Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives sum of n-th group.
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the first term of each group.A074125
Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the first term of each group.
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the number of terms in each group.A074126
Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the number of terms in each group.
- Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the group sum divided by n-th prime for the n-th group.A074127
Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the group sum divided by n-th prime for the n-th group.
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum for each group.A074128
Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the sum for each group.
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the first term of each group.A074129
Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the first term of each group.
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the number of prime in each group.A074130
Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the number of prime in each group.
- Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the group sum divided by n for the n-th group.A074131
Group successively larger prime numbers so that the sum of the n-th group is a multiple of n. Sequence gives the group sum divided by n for the n-th group.
- Row sums of triangle A074135.A074132
Row sums of triangle A074135.
- Average of the n-th group, if positive integers are rearranged in groups of k=1,2,3,... numbers whose sum is a multiple of k.A074133
Average of the n-th group, if positive integers are rearranged in groups of k=1,2,3,... numbers whose sum is a multiple of k.
- First column of triangle A074135.A074134
First column of triangle A074135.
- Triangle read by rows: for 1 <= k < n, a(n, k) is the least positive integer not already used. a(n, n) is the least positive integer not already used that makes the row sum a multiple of n.A074135
Triangle read by rows: for 1 <= k < n, a(n, k) is the least positive integer not already used. a(n, n) is the least positive integer not already used that makes the row sum a multiple of n.
- Main diagonal of triangle A074135.A074136
Main diagonal of triangle A074135.
- a(1) = 1; then append numbers greater than the previous term so that the n-th term a(n) divides the sum of next a(n) terms.A074137
a(1) = 1; then append numbers greater than the previous term so that the n-th term a(n) divides the sum of next a(n) terms.
- Numbers which are not members of A074137.A074138
Numbers which are not members of A074137.
- Number of divisors of A036035(n,k).A074139
Number of divisors of A036035(n,k).
- Sum of least integers of prime signatures over all partitions of n.A074140
Sum of least integers of prime signatures over all partitions of n.
- Sum of products of parts increased by 1 in all partitions of n.A074141
Sum of products of parts increased by 1 in all partitions of n.
- a(n) is the coefficient of x^n in x/(1 + Sum_{k>=1} (1/2)*(prime(k+1) - 1)*x^k).A074142
a(n) is the coefficient of x^n in x/(1 + Sum_{k>=1} (1/2)*(prime(k+1) - 1)*x^k).
- a(1) = 1; a(n) = n * Sum_{k=1..n-1} a(k).A074143
a(1) = 1; a(n) = n * Sum_{k=1..n-1} a(k).
- The differences arising in A075275.A074144
The differences arising in A075275.
- a(1) = 1; for n>1, a(n) is the smallest previously unused natural number such that a(n) divides the sum of next a(n) terms.A074145
a(1) = 1; for n>1, a(n) is the smallest previously unused natural number such that a(n) divides the sum of next a(n) terms.
- Erroneous version of A074135.A074146
Erroneous version of A074135.
- (2n-1) odd numbers followed by 2n even numbers.A074147
(2n-1) odd numbers followed by 2n even numbers.
- a(n) = n + floor(n^2/2).A074148
a(n) = n + floor(n^2/2).
- Sum of terms in each group in A074147.A074149
Sum of terms in each group in A074147.
- Duplicate of A061925.A074150
Duplicate of A061925.
- Least power of 2 > 2^n with initial digits matching the digits of 2^n.A074151
Least power of 2 > 2^n with initial digits matching the digits of 2^n.
- Least power of 3 > 3^n with initial digits matching the digits of 3^n.A074152
Least power of 3 > 3^n with initial digits matching the digits of 3^n.
- Smallest n-digit power of n; or 0 if no such number exists.A074153
Smallest n-digit power of n; or 0 if no such number exists.
- Largest n-digit power of n; or 0 if no such number exists.A074154
Largest n-digit power of n; or 0 if no such number exists.
- Group the natural numbers so that the product of members of a group is a multiple of the sum: (1),(2,3,4,5,6),(7,8,9),(10,11,12),(13,14,15),(16,17,18),(19,20,21),(22,23,24),.... This is the sequence of the ratio of product /sum.A074155
Group the natural numbers so that the product of members of a group is a multiple of the sum: (1),(2,3,4,5,6),(7,8,9),(10,11,12),(13,14,15),(16,17,18),(19,20,21),(22,23,24),.... This is the sequence of the ratio of product /sum.
- Smallest multiple of n with initial digits that of the reversal of n, deleting the leading zeros wherever required.A074156
Smallest multiple of n with initial digits that of the reversal of n, deleting the leading zeros wherever required.
- Smallest multiple of n which uses no digits of n, or 0 if no such number exists.A074157
Smallest multiple of n which uses no digits of n, or 0 if no such number exists.
- Smallest multiple of n which begins with the concatenation of first n natural numbers.A074158
Smallest multiple of n which begins with the concatenation of first n natural numbers.
- Smallest multiple of n which begins with the reverse concatenation of first n natural numbers.A074159
Smallest multiple of n which begins with the reverse concatenation of first n natural numbers.
- Smallest multiple of n (>n) using all prime digits; or 0 if no such number exists.A074160
Smallest multiple of n (>n) using all prime digits; or 0 if no such number exists.