Sequences
392,541 sequences
- a(n) = A051201(2^n).A078161
a(n) = A051201(2^n).
- a(n) = A051201(n!).A078162
a(n) = A051201(n!).
- a(n) = A051201(n^2).A078163
a(n) = A051201(n^2).
- Numbers k such that phi(k) is a perfect biquadrate.A078164
Numbers k such that phi(k) is a perfect biquadrate.
- Numbers k such that phi(k) is a perfect 5th power.A078165
Numbers k such that phi(k) is a perfect 5th power.
- Numbers k such that phi(k) is a perfect sixth power.A078166
Numbers k such that phi(k) is a perfect sixth power.
- Numbers k such that phi(k) is a perfect 7th power.A078167
Numbers k such that phi(k) is a perfect 7th power.
- Numbers k such that phi(k) is a perfect 8th power.A078168
Numbers k such that phi(k) is a perfect 8th power.
- Numbers k such that phi(k) is a perfect 9th power.A078169
Numbers k such that phi(k) is a perfect 9th power.
- Numbers k such that phi(k) is a perfect tenth power.A078170
Numbers k such that phi(k) is a perfect tenth power.
- a(n) = A055086(A000040(n)).A078171
a(n) = A055086(A000040(n)).
- a(n) = A051201(A000040(n)).A078172
a(n) = A051201(A000040(n)).
- a(n) = max(min(r,s,t)), where the maximum is taken over all positive integer solutions of the Diophantine equation r*s*t = n * (r+s+t).A078173
a(n) = max(min(r,s,t)), where the maximum is taken over all positive integer solutions of the Diophantine equation r*s*t = n * (r+s+t).
- Numbers with an integer arithmetic mean of distinct prime factors.A078174
Numbers with an integer arithmetic mean of distinct prime factors.
- Numbers with an integer arithmetic mean of all prime factors.A078175
Numbers with an integer arithmetic mean of all prime factors.
- Numbers given by the Rule 225 Cellular Automaton.A078176
Numbers given by the Rule 225 Cellular Automaton.
- Composite numbers with an integer arithmetic mean of all prime factors.A078177
Composite numbers with an integer arithmetic mean of all prime factors.
- Least k>=2 such that n^k + n - 1 is prime.A078178
Least k>=2 such that n^k + n - 1 is prime.
- a(n) is the smallest prime of the form n^k + n - 1 with k >= 2.A078179
a(n) is the smallest prime of the form n^k + n - 1 with k >= 2.
- a(n) = smallest integer that can't be written as p*a(i)+1, for any prime p and 0<i<n, where a(1)=1 and a(n) > a(n-1).A078180
a(n) = smallest integer that can't be written as p*a(i)+1, for any prime p and 0<i<n, where a(1)=1 and a(n) > a(n-1).
- a(n) = Sum_{d|n, d == 1 (mod 3)} d.A078181
a(n) = Sum_{d|n, d == 1 (mod 3)} d.
- a(n) = Sum_{d|n, d == 2 (mod 3)} d.A078182
a(n) = Sum_{d|n, d == 2 (mod 3)} d.
- Number of solutions to x^2 + y^2 + z^2 < n^2; number of lattice points inside a sphere of radius n.A078183
Number of solutions to x^2 + y^2 + z^2 < n^2; number of lattice points inside a sphere of radius n.
- Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.A078184
Number of solutions to n^2 < x^2 + y^2 + z^2 < (n+1)^2; number of lattice points between spheres of radii n and n+1.
- Number of n X n matrices over an alphabet of size 15.A078185
Number of n X n matrices over an alphabet of size 15.
- Number of n X n matrices over an alphabet of size 16.A078186
Number of n X n matrices over an alphabet of size 16.
- Smaller of the two successive squares which differ in the use of only one digit.A078187
Smaller of the two successive squares which differ in the use of only one digit.
- a(1) = 1; for n > 1 take the digits of a(n-1) one after the other and remove one occurrence of this digit from the digits of m = k*n (k > 0) if possible; a(n) is the smallest multiple m of n which has the least number of remaining digits (counted with multiplicity).A078188
a(1) = 1; for n > 1 take the digits of a(n-1) one after the other and remove one occurrence of this digit from the digits of m = k*n (k > 0) if possible; a(n) is the smallest multiple m of n which has the least number of remaining digits (counted with multiplicity).
- Array read by rows in which the n-th row contains the multiples of n in increasing order using all the digits of first n numbers.A078189
Array read by rows in which the n-th row contains the multiples of n in increasing order using all the digits of first n numbers.
- Primes of the form A004154(n) - 1.A078190
Primes of the form A004154(n) - 1.
- a(n) = concatenation of n n times divided by n.A078191
a(n) = concatenation of n n times divided by n.
- a(n) = floor(concatenation of n down to 1 divided by n).A078192
a(n) = floor(concatenation of n down to 1 divided by n).
- In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the final terms of rows.A078193
In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the final terms of rows.
- In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the triangle by rows.A078194
In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the triangle by rows.
- In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the sum of the terms of a row.A078195
In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the sum of the terms of a row.
- The n-th digit from the left (most significant digit) of n^n.A078196
The n-th digit from the left (most significant digit) of n^n.
- Position of the start of the first occurrence of n after the decimal point in e = 2.71828182845904523536...A078197
Position of the start of the first occurrence of n after the decimal point in e = 2.71828182845904523536...
- Numbers that cannot be partitioned into distinct powers of 3, 5 and 7, all with positive exponents.A078198
Numbers that cannot be partitioned into distinct powers of 3, 5 and 7, all with positive exponents.
- Smallest multiple of n (for n >= 100) in which frequency of each occurring digit is the same.A078199
Smallest multiple of n (for n >= 100) in which frequency of each occurring digit is the same.
- a(n) = A078199(n)/n; i.e., smallest k such that frequency of each occurring digit in k*n is the same.A078200
a(n) = A078199(n)/n; i.e., smallest k such that frequency of each occurring digit in k*n is the same.
- Smallest prime of the form n^k + k^n, or 0 if no such prime exists.A078201
Smallest prime of the form n^k + k^n, or 0 if no such prime exists.
- a(n) is the smallest prime of the form abs(n^k - k^n), the absolute difference between n^k and k^n, or -1 if no such prime exists.A078202
a(n) is the smallest prime of the form abs(n^k - k^n), the absolute difference between n^k and k^n, or -1 if no such prime exists.
- Numbers k such that A004154(k) + 1 is prime.A078203
Numbers k such that A004154(k) + 1 is prime.
- Smallest multiple of the concatenation of 1 up to n that begins with the concatenation of n down to 1.A078204
Smallest multiple of the concatenation of 1 up to n that begins with the concatenation of n down to 1.
- a(n) = A078204(n) / A007908(n).A078205
a(n) = A078204(n) / A007908(n).
- Smallest multiple of the concatenation of n down to 1 that begins with the concatenation of 1 up to n.A078206
Smallest multiple of the concatenation of n down to 1 that begins with the concatenation of 1 up to n.
- a(n) = A078206(n) / A000422(n).A078207
a(n) = A078206(n) / A000422(n).
- Smallest multiple of n beginning with the n-th prime.A078208
Smallest multiple of n beginning with the n-th prime.
- Smallest multiple of the n-th prime beginning with n.A078209
Smallest multiple of the n-th prime beginning with n.
- Smallest multiple of n^2 beginning with n.A078210
Smallest multiple of n^2 beginning with n.