Sequences
392,541 sequences
- Triangle read by rows in which the n-th row contains n smallest numbers not coprime to n; except first row = {1}.A077661
Triangle read by rows in which the n-th row contains n smallest numbers not coprime to n; except first row = {1}.
- a(n) = n-th positive integer not relatively prime to n, with a(1)=1.A077662
a(n) = n-th positive integer not relatively prime to n, with a(1)=1.
- Sum of terms of n-th row of A077661.A077663
Sum of terms of n-th row of A077661.
- Triangle in which the n-th row contains n smallest numbers greater than n and coprime to n.A077664
Triangle in which the n-th row contains n smallest numbers greater than n and coprime to n.
- Final term of n-th row of A077664.A077665
Final term of n-th row of A077664.
- Sum of terms of n-th row of A077664.A077666
Sum of terms of n-th row of A077664.
- Triangle read by rows. Let k = n-th composite number. The n-th row gives k smallest numbers unrelated to k (numbers which do not divide k, are not divisible by k and are not coprime to k).A077667
Triangle read by rows. Let k = n-th composite number. The n-th row gives k smallest numbers unrelated to k (numbers which do not divide k, are not divisible by k and are not coprime to k).
- Last term of row n of A077667.A077668
Last term of row n of A077667.
- Triangle read by rows. Let k = n-th composite number. Then n-th row gives n smallest numbers unrelated to k (numbers which do not divide k, are not divisible by k and are not coprime to k).A077669
Triangle read by rows. Let k = n-th composite number. Then n-th row gives n smallest numbers unrelated to k (numbers which do not divide k, are not divisible by k and are not coprime to k).
- Last term of row n of A077669.A077670
Last term of row n of A077669.
- Triangular numbers whose digit permutations yield at least one further triangular number.A077671
Triangular numbers whose digit permutations yield at least one further triangular number.
- a(1) = 1; for n > 1, a(n) = smallest triangular number which is n times another triangular number > 1, or -1 if no such number exists.A077672
a(1) = 1; for n > 1, a(n) = smallest triangular number which is n times another triangular number > 1, or -1 if no such number exists.
- Duplicate of A071255.A077673
Duplicate of A071255.
- Squarefree numbers with nonzero squarefree digits (2,3,5,6,7).A077674
Squarefree numbers with nonzero squarefree digits (2,3,5,6,7).
- Squarefree numbers with square nonzero square digits.A077675
Squarefree numbers with square nonzero square digits.
- Squares using only squarefree digits (2, 3, 5, 6, 7).A077676
Squares using only squarefree digits (2, 3, 5, 6, 7).
- Squarefree numbers beginning with 1.A077677
Squarefree numbers beginning with 1.
- Squarefree numbers beginning with 2.A077678
Squarefree numbers beginning with 2.
- Squarefree numbers beginning with 3.A077679
Squarefree numbers beginning with 3.
- Squarefree numbers beginning with 4.A077680
Squarefree numbers beginning with 4.
- Squarefree numbers beginning with 5.A077681
Squarefree numbers beginning with 5.
- Squarefree numbers beginning with 6.A077682
Squarefree numbers beginning with 6.
- Squarefree numbers beginning with 7.A077683
Squarefree numbers beginning with 7.
- Squarefree numbers beginning with 8.A077684
Squarefree numbers beginning with 8.
- Squarefree numbers beginning with 9.A077685
Squarefree numbers beginning with 9.
- 2^(n-1) - (prime(n) mod n).A077686
2^(n-1) - (prime(n) mod n).
- a(n) = n-th squarefree number beginning with n.A077687
a(n) = n-th squarefree number beginning with n.
- a(n) = sum of all cyclic permuted concatenations of the next n numbers.A077688
a(n) = sum of all cyclic permuted concatenations of the next n numbers.
- Rearrangement of squares such that the most significant digits follow the cyclic pattern 1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,...A077689
Rearrangement of squares such that the most significant digits follow the cyclic pattern 1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,...
- Rearrangement of triangular numbers such that the most significant digits follow the cyclic pattern 1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,...A077690
Rearrangement of triangular numbers such that the most significant digits follow the cyclic pattern 1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,1,2,3,...
- a(n) = A076803(n)/n.A077691
a(n) = A076803(n)/n.
- Smallest triangular number which begins with the concatenation of first n natural numbers.A077692
Smallest triangular number which begins with the concatenation of first n natural numbers.
- Smallest triangular number which begins with the concatenation of n times digits of n.A077693
Smallest triangular number which begins with the concatenation of n times digits of n.
- a(n) = triangular number whose index is the concatenation of the first n natural numbers.A077694
a(n) = triangular number whose index is the concatenation of the first n natural numbers.
- a(n) = triangular number whose index is n concatenated n times.A077695
a(n) = triangular number whose index is n concatenated n times.
- a(0) = 2; a(n) = smallest multiple of a(n-1), not a multiple of 10, that contains all the digits of a(n-1).A077696
a(0) = 2; a(n) = smallest multiple of a(n-1), not a multiple of 10, that contains all the digits of a(n-1).
- a(n) = A077696(n+1)/A077696(n).A077697
a(n) = A077696(n+1)/A077696(n).
- a(1) = 3, a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1), or which can be obtained by inserting digits anywhere in a permutation of digits of a(n-1) (prefix, suffix or insertion). Zeros are not to be suffixed. a(n) is not divisible by 10.A077698
a(1) = 3, a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1), or which can be obtained by inserting digits anywhere in a permutation of digits of a(n-1) (prefix, suffix or insertion). Zeros are not to be suffixed. a(n) is not divisible by 10.
- a(n) = A077698(n+1)/A077698(n).A077699
a(n) = A077698(n+1)/A077698(n).
- a(1) = 4; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.A077700
a(1) = 4; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.
- a(n) = A077700(n+1)/A077700(n).A077701
a(n) = A077700(n+1)/A077700(n).
- a(1) = 5; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.A077702
a(1) = 5; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.
- a(n) = A077702(n+1)/A077702(n).A077703
a(n) = A077702(n+1)/A077702(n).
- a(1) = 6; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.A077704
a(1) = 6; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.
- a(n) = A077704(n+1)/A077704(n).A077705
a(n) = A077704(n+1)/A077704(n).
- a(1) = 7; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.A077706
a(1) = 7; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.
- a(n) = A077706(n+1)/A077706(n).A077707
a(n) = A077706(n+1)/A077706(n).
- a(1) = 8; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.A077708
a(1) = 8; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.
- a(n) = A077708(n+1)/A077708(n).A077709
a(n) = A077708(n+1)/A077708(n).
- a(1) = 9; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.A077710
a(1) = 9; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.