Sequences
392,541 sequences
- Final terms of rows of triangle in A077159.A077161
Final terms of rows of triangle in A077159.
- Sum of terms in n-th rows of triangle in A077159.A077162
Sum of terms in n-th rows of triangle in A077159.
- n-th power of next n numbers.A077163
n-th power of next n numbers.
- Triangle in which n-th row gives n numbers relatively prime to n and greater than all earlier terms in the triangle.A077164
Triangle in which n-th row gives n numbers relatively prime to n and greater than all earlier terms in the triangle.
- Leading terms of rows in A077164.A077165
Leading terms of rows in A077164.
- Final terms of rows in A077164.A077166
Final terms of rows in A077164.
- Sum of terms in n-th row of A077164.A077167
Sum of terms in n-th row of A077164.
- Lexicographically earliest infinite sequence of distinct positive numbers with the property that when written as a triangle, the product of each row is a factorial.A077168
Lexicographically earliest infinite sequence of distinct positive numbers with the property that when written as a triangle, the product of each row is a factorial.
- Initial terms of rows of A077168.A077169
Initial terms of rows of A077168.
- Final terms of rows of A077168.A077170
Final terms of rows of A077168.
- a(n) = k where k! is the product of the terms of the n-th row of A077168.A077171
a(n) = k where k! is the product of the terms of the n-th row of A077168.
- Triangle formed by grouping the natural numbers so that the n-th row contains n numbers whose product has exactly n distinct prime divisors.A077172
Triangle formed by grouping the natural numbers so that the n-th row contains n numbers whose product has exactly n distinct prime divisors.
- Initial terms of rows of triangle in A077172.A077173
Initial terms of rows of triangle in A077172.
- Final terms of rows of triangle in A077172.A077174
Final terms of rows of triangle in A077172.
- Product of terms in n-th row of triangle in A077172.A077175
Product of terms in n-th row of triangle in A077172.
- Largest squarefree number that divides A077175(n).A077176
Largest squarefree number that divides A077175(n).
- Number of primitive Pythagorean triangles with perimeter equal to A002110(n), the product of the first n primes.A077177
Number of primitive Pythagorean triangles with perimeter equal to A002110(n), the product of the first n primes.
- Continued fraction expansion of Sum_{k >= 1} 1/k^k.A077178
Continued fraction expansion of Sum_{k >= 1} 1/k^k.
- Duplicate of A076179.A077179
Duplicate of A076179.
- Smallest concatenation of integers starting from 1 that is a multiple of the n-th prime.A077180
Smallest concatenation of integers starting from 1 that is a multiple of the n-th prime.
- Smallest number k such that k*prime(n) is a concatenation of successive integers starting from 1.A077181
Smallest number k such that k*prime(n) is a concatenation of successive integers starting from 1.
- Smallest number k such that the concatenation of natural numbers from 1 to k is divisible by the prime(n).A077182
Smallest number k such that the concatenation of natural numbers from 1 to k is divisible by the prime(n).
- Smallest number k such that the reverse concatenation of natural numbers from k to 1 is divisible by prime(n), or 0 if no such number exists.A077183
Smallest number k such that the reverse concatenation of natural numbers from k to 1 is divisible by prime(n), or 0 if no such number exists.
- Duplicate of A077183.A077184
Duplicate of A077183.
- a(n) = A000422(A077183(n))/prime(n).A077185
a(n) = A000422(A077183(n))/prime(n).
- Smallest multiple of prime(n) of the form 123...(k-1) k (k-1)...321 ( a concatenation of natural numbers from 1 to k and back to 1), or 0 if no such number exists.A077186
Smallest multiple of prime(n) of the form 123...(k-1) k (k-1)...321 ( a concatenation of natural numbers from 1 to k and back to 1), or 0 if no such number exists.
- Smallest k such that the concatenation 123...(k-1) k (k-1)...321 ( a concatenation of natural numbers from 1 to k and back to 1) is a multiple of prime(n), or 0 if no such number exists.A077187
Smallest k such that the concatenation 123...(k-1) k (k-1)...321 ( a concatenation of natural numbers from 1 to k and back to 1) is a multiple of prime(n), or 0 if no such number exists.
- a(n) = A077186(n)/prime(n).A077188
a(n) = A077186(n)/prime(n).
- Smallest concatenation 123...(k-1) k (k-1)...321 (a concatenation of natural numbers from 1 to k and back to 1) that is a multiple of 2n-1, or 0 if no such number exists.A077189
Smallest concatenation 123...(k-1) k (k-1)...321 (a concatenation of natural numbers from 1 to k and back to 1) that is a multiple of 2n-1, or 0 if no such number exists.
- a(n) = A077189(n)/(2n-1).A077190
a(n) = A077189(n)/(2n-1).
- Number of possible character tables for a group of order n.A077191
Number of possible character tables for a group of order n.
- {Concatenation of n-1 and n+1}/n where n is a member of A069871.A077192
{Concatenation of n-1 and n+1}/n where n is a member of A069871.
- Number of multiples of n that can be obtained by permuting the digits of number formed by the concatenation of first n numbers.A077193
Number of multiples of n that can be obtained by permuting the digits of number formed by the concatenation of first n numbers.
- Smallest multiple of n with least digit sum.A077194
Smallest multiple of n with least digit sum.
- a(n) = A077194(n)/n.A077195
a(n) = A077194(n)/n.
- Smallest possible sum of the digits of a multiple of n.A077196
Smallest possible sum of the digits of a multiple of n.
- a(n) = lambda(phi(n)) where lambda(n) (A002322) is the Carmichael lambda function which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n and phi(n) is A000010.A077197
a(n) = lambda(phi(n)) where lambda(n) (A002322) is the Carmichael lambda function which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n and phi(n) is A000010.
- a(n) = lambda(sigma(n)), where lambda(n) is the Carmichael lambda function, which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n.A077198
a(n) = lambda(sigma(n)), where lambda(n) is the Carmichael lambda function, which gives the smallest integer m such that k^m = 1 mod n for all integers k relatively prime to n.
- Smallest k such that both k and k+n are squarefree.A077199
Smallest k such that both k and k+n are squarefree.
- Erroneous version of A085072.A077200
Erroneous version of A085072.
- Erroneous version of A120426.A077201
Erroneous version of A120426.
- a(1) = 1, a(n) = smallest number such that the concatenation of two successive terms gives a prime which has not occurred earlier.A077202
a(1) = 1, a(n) = smallest number such that the concatenation of two successive terms gives a prime which has not occurred earlier.
- a(1) = 2. Then the smallest n-digit prime starting with the last digit of the previous term.A077203
a(1) = 2. Then the smallest n-digit prime starting with the last digit of the previous term.
- a(1) = 1 . Then smallest n-digit square (MSD) starting with the LSD of the previous term and not a multiple of 100.A077204
a(1) = 1 . Then smallest n-digit square (MSD) starting with the LSD of the previous term and not a multiple of 100.
- a(n) = sqrt(A077204(n)).A077205
a(n) = sqrt(A077204(n)).
- a(1) = 1 and then smallest n-digit triangular number starting with the least significant digit of the previous term and not a multiple of 10.A077206
a(1) = 1 and then smallest n-digit triangular number starting with the least significant digit of the previous term and not a multiple of 10.
- Triangular number index of A077206(n).A077207
Triangular number index of A077206(n).
- Rearrangement of squarefree numbers such that a(k) begins with the end of a(k-1).A077208
Rearrangement of squarefree numbers such that a(k) begins with the end of a(k-1).
- a(1) = 2, then the smallest squarefree number greater than the previous term that begins with the end of the previous term.A077209
a(1) = 2, then the smallest squarefree number greater than the previous term that begins with the end of the previous term.
- a(1) = 2, a(n+1) is the smallest squarefree number greater than n*a(n).A077210
a(1) = 2, a(n+1) is the smallest squarefree number greater than n*a(n).