Sequences
392,541 sequences
- Least common multiple of the first n terms of A002473 (7-smooth numbers).A085911
Least common multiple of the first n terms of A002473 (7-smooth numbers).
- Group the natural numbers such that the product of the terms of the n-th group is divisible by n!. (1),(2),(3,4),(5,6,7,8),(9,10,11,12),(13,14,15,16,17,18),(19,20,21,22,23,24),... Sequence contains the product pertaining to groups.A085912
Group the natural numbers such that the product of the terms of the n-th group is divisible by n!. (1),(2),(3,4),(5,6,7,8),(9,10,11,12),(13,14,15,16,17,18),(19,20,21,22,23,24),... Sequence contains the product pertaining to groups.
- Group the natural numbers such that the product of the terms of the n-th group is divisible by n!. (1),(2),(3,4),(5,6,7,8),(9,10,11,12),(13,14,15,16,17,18),(19,20,21,22,23,24),... Sequence contains the first term of every group.A085913
Group the natural numbers such that the product of the terms of the n-th group is divisible by n!. (1),(2),(3,4),(5,6,7,8),(9,10,11,12),(13,14,15,16,17,18),(19,20,21,22,23,24),... Sequence contains the first term of every group.
- Group the natural numbers so that the product of the terms of the n-th group is divisible by n!: (1),(2),(3,4),(5,6,7,8),(9,10,11,12),(13,14,15,16,17,18),(19,20,21,22,23,24),... Sequence contains the number of terms in each group.A085914
Group the natural numbers so that the product of the terms of the n-th group is divisible by n!: (1),(2),(3,4),(5,6,7,8),(9,10,11,12),(13,14,15,16,17,18),(19,20,21,22,23,24),... Sequence contains the number of terms in each group.
- Group the natural numbers such that the product of the terms of the n-th group is divisible by n!: (1), (2), (3, 4), (5, 6, 7, 8), (9, 10, 11, 12), (13, 14, 15, 16, 17, 18), (19, 20, 21, 22, 23, 24), ... Sequence contains the product of the terms of the n-th group divided by n!. a(n) = A085912(n)/(n!).A085915
Group the natural numbers such that the product of the terms of the n-th group is divisible by n!: (1), (2), (3, 4), (5, 6, 7, 8), (9, 10, 11, 12), (13, 14, 15, 16, 17, 18), (19, 20, 21, 22, 23, 24), ... Sequence contains the product of the terms of the n-th group divided by n!. a(n) = A085912(n)/(n!).
- Array T(i,1)=i, T(1,j)=j and T(i,j)=T(i-1,j-1)*T(i,j-1) read by antidiagonals.A085916
Array T(i,1)=i, T(1,j)=j and T(i,j)=T(i-1,j-1)*T(i,j-1) read by antidiagonals.
- Least k such that k*2^n - 1 is a semiprime.A085917
Least k such that k*2^n - 1 is a semiprime.
- Primes p such that for some k the number of terms > 0 and < 1 in the Farey sequence of order k is p.A085918
Primes p such that for some k the number of terms > 0 and < 1 in the Farey sequence of order k is p.
- Number of ways a loop can cross three roads meeting in a Y n times.A085919
Number of ways a loop can cross three roads meeting in a Y n times.
- Smallest palindromic multiple (not equal to the number itself) of the palindromes not included earlier.A085920
Smallest palindromic multiple (not equal to the number itself) of the palindromes not included earlier.
- Duplicate of A005243.A085921
Duplicate of A005243.
- Duplicate of A048973.A085922
Duplicate of A048973.
- a(0) = 1, a(n+1) = (n+1)*(a(n) + n).A085923
a(0) = 1, a(n+1) = (n+1)*(a(n) + n).
- If k = product (p_i)^(r_i), where p_i are primes in increasing order, then k is a member if concatenation of r_i as decimal numbers forms a palindrome.A085924
If k = product (p_i)^(r_i), where p_i are primes in increasing order, then k is a member if concatenation of r_i as decimal numbers forms a palindrome.
- a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is not prime".A085925
a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is not prime".
- a(n) = n if n is composite, else a(n) = smallest composite number beginning with n not obtained trivially by simply placing a zero as a least significant digit; i.e., a(n) is not equal to 10n.A085926
a(n) = n if n is composite, else a(n) = smallest composite number beginning with n not obtained trivially by simply placing a zero as a least significant digit; i.e., a(n) is not equal to 10n.
- a(n) is the digitwise absolute difference between the n-th palindrome and its 9's complement.A085927
a(n) is the digitwise absolute difference between the n-th palindrome and its 9's complement.
- a(1) = 1, a(2) = 2, then the absolute difference of the concatenation of two previous terms and its digit reversal.A085928
a(1) = 1, a(2) = 2, then the absolute difference of the concatenation of two previous terms and its digit reversal.
- Smaller of two consecutive numbers with the same prime signature not occurring earlier.A085929
Smaller of two consecutive numbers with the same prime signature not occurring earlier.
- Triangle read by rows in which row n contains n smallest (> 0) numbers which when incremented by n yield a triangular number.A085930
Triangle read by rows in which row n contains n smallest (> 0) numbers which when incremented by n yield a triangular number.
- Leading diagonal of A085930.A085931
Leading diagonal of A085930.
- Numbers k such that (digits of k sorted in ascending order) + (digital sum of k) is a palindrome.A085932
Numbers k such that (digits of k sorted in ascending order) + (digital sum of k) is a palindrome.
- Palindromes in A085932.A085933
Palindromes in A085932.
- Numbers k such that (digits of k sorted in ascending order) + (digital product of k) is a palindrome. Or, sortdigits(k) + digitproduct(k) is a palindrome.A085934
Numbers k such that (digits of k sorted in ascending order) + (digital product of k) is a palindrome. Or, sortdigits(k) + digitproduct(k) is a palindrome.
- Palindromes in A085934.A085935
Palindromes in A085934.
- Numbers k such that the number resulting from sorting the digits of k in ascending order + the sum of the squares of the digits of k is a palindrome. Or, sortdigits(k) + digitsumsquare(k) is a palindrome.A085936
Numbers k such that the number resulting from sorting the digits of k in ascending order + the sum of the squares of the digits of k is a palindrome. Or, sortdigits(k) + digitsumsquare(k) is a palindrome.
- Palindromes in A085936.A085937
Palindromes in A085936.
- a(n) is the (n+1)-digit number in which the first digit is 1 and the subsequent digits increase by steps of n (mod 10).A085938
a(n) is the (n+1)-digit number in which the first digit is 1 and the subsequent digits increase by steps of n (mod 10).
- Horadam sequence (0,1,6,4).A085939
Horadam sequence (0,1,6,4).
- After correction, duplicate of A061509.A085940
After correction, duplicate of A061509.
- Duplicate of A054842.A085941
Duplicate of A054842.
- Write digit reversal of n below n. Then a(n) = the sum of the product of digits in the same column.A085942
Write digit reversal of n below n. Then a(n) = the sum of the product of digits in the same column.
- Let S = 123456789101112131415..., the concatenation of the natural numbers; partition this string into distinct squarefree numbers. To avoid leading zeros, no number may end at the digit that comes before a 0 in S.A085943
Let S = 123456789101112131415..., the concatenation of the natural numbers; partition this string into distinct squarefree numbers. To avoid leading zeros, no number may end at the digit that comes before a 0 in S.
- Let S = 12345678901234567890123456..., the cyclic concatenation of digits; partition this string into distinct squarefree numbers. To avoid leading zeros, no member may end with the digit 9.A085944
Let S = 12345678901234567890123456..., the cyclic concatenation of digits; partition this string into distinct squarefree numbers. To avoid leading zeros, no member may end with the digit 9.
- Number of subsets of {1,2,...,n} with relatively prime elements.A085945
Number of subsets of {1,2,...,n} with relatively prime elements.
- a(1) = 1, a(2) = 2 and a(n) = smallest number not included earlier that divides the concatenation a(n-2), a(n-1).A085946
a(1) = 1, a(2) = 2 and a(n) = smallest number not included earlier that divides the concatenation a(n-2), a(n-1).
- a(1) = 1, a(2) = 2 and a(n) = smallest number not included earlier that divides the sum of the two previous terms.A085947
a(1) = 1, a(2) = 2 and a(n) = smallest number not included earlier that divides the sum of the two previous terms.
- Total number of elements in all subsets of {1,2,..,n} with relatively prime elements.A085948
Total number of elements in all subsets of {1,2,..,n} with relatively prime elements.
- Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n+1). r and s are positive integers.A085949
Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n+1). r and s are positive integers.
- Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n-2). r and s are positive integers.A085950
Smallest multiple of prime(n) of the form r*prime(n-1) + s*prime(n-2). r and s are positive integers.
- For n <= 5, a(n) = 2n-1. For n > 5, a(n) is the least odd number not already used that begins with the last digit of a(n-1).A085951
For n <= 5, a(n) = 2n-1. For n > 5, a(n) is the least odd number not already used that begins with the last digit of a(n-1).
- First n-digit number that occurs in the sequence A085951.A085952
First n-digit number that occurs in the sequence A085951.
- a(1) = 2, a(n+1) = the smallest multiple of prime(n+1) beginning with a(n).A085953
a(1) = 2, a(n+1) = the smallest multiple of prime(n+1) beginning with a(n).
- a(1) = 4, a(n+1) = the smallest multiple of composite(n+1) beginning with a(n).A085954
a(1) = 4, a(n+1) = the smallest multiple of composite(n+1) beginning with a(n).
- Composites such that the number of 1's in their binary expansion is equal to the number of 1's in the binary expansion of the sum of their prime factors (counting repetition).A085955
Composites such that the number of 1's in their binary expansion is equal to the number of 1's in the binary expansion of the sum of their prime factors (counting repetition).
- Smallest prime p such that (2n)*p +1 and (p-1)/(2n) are prime, or 0 if no such prime exists.A085956
Smallest prime p such that (2n)*p +1 and (p-1)/(2n) are prime, or 0 if no such prime exists.
- Primes p such that 6p + 1 and (p-1)/6 are primes.A085957
Primes p such that 6p + 1 and (p-1)/6 are primes.
- Primes p such that 8p +1 and (p-1)/8 are primes.A085958
Primes p such that 8p +1 and (p-1)/8 are primes.
- Multiples of 37.A085959
Multiples of 37.
- Size of the largest code of length 4 and minimum distance 3 over an alphabet of size n. This is usually denoted by A_{n}(4,3).A085960
Size of the largest code of length 4 and minimum distance 3 over an alphabet of size n. This is usually denoted by A_{n}(4,3).