Sequences
392,541 sequences
- Numbers n that divide the concatenation of next n numbers.A069861
Numbers n that divide the concatenation of next n numbers.
- Smallest k such that n divides the concatenation of numbers from (n+1) to (n+k), where (n+1) is on the most significant side.A069862
Smallest k such that n divides the concatenation of numbers from (n+1) to (n+k), where (n+1) is on the most significant side.
- a(n) is the shortest concatenation of two or more decreasing consecutive numbers (n)(n-1)...(0) such that n divides a(n), or n if there is no such concatenation.A069863
a(n) is the shortest concatenation of two or more decreasing consecutive numbers (n)(n-1)...(0) such that n divides a(n), or n if there is no such concatenation.
- Decimal expansion of 2/log(4/3).A069864
Decimal expansion of 2/log(4/3).
- a(n) = Sum_{k = 0..n} C(n,k)^6.A069865
a(n) = Sum_{k = 0..n} C(n,k)^6.
- Primes in which repeatedly deleting the most significant digit then the least significant digit gives a prime at every step until a single-digit prime remains.A069866
Primes in which repeatedly deleting the most significant digit then the least significant digit gives a prime at every step until a single-digit prime remains.
- Primes in which repeatedly deleting the least significant digit then the most significant digit gives a prime at every step until a single-digit prime remains.A069867
Primes in which repeatedly deleting the least significant digit then the most significant digit gives a prime at every step until a single-digit prime remains.
- Smallest n-th power whose digit reversal is a prime.A069868
Smallest n-th power whose digit reversal is a prime.
- Largest prime that is a concatenation of the parts of a partition of n, or 0 if no such prime exists.A069869
Largest prime that is a concatenation of the parts of a partition of n, or 0 if no such prime exists.
- Smallest prime that can be formed using a partition of n, or 0 if no such prime exists.A069870
Smallest prime that can be formed using a partition of n, or 0 if no such prime exists.
- Numbers m that divide the concatenation of m-1 and m+1.A069871
Numbers m that divide the concatenation of m-1 and m+1.
- Numbers k such that k divides the concatenation all divisors in ascending order, i.e., k divides A037278(k).A069872
Numbers k such that k divides the concatenation all divisors in ascending order, i.e., k divides A037278(k).
- Smallest concatenation of powers of 2 in ascending order that is a multiple of n, or 0 if no such number exists.A069873
Smallest concatenation of powers of 2 in ascending order that is a multiple of n, or 0 if no such number exists.
- a(1) = a(2) = 1; a(n) = 2^a(n-1) + 2^a(n-2) for n > 2.A069874
a(1) = a(2) = 1; a(n) = 2^a(n-1) + 2^a(n-2) for n > 2.
- Smallest multiple of n with a prime signature different from all previous terms.A069875
Smallest multiple of n with a prime signature different from all previous terms.
- a(n) = (k-n+1)^n + (k-n+2)^n + ... + (k-1)^n + k^n, where k = n(n+1)/2.A069876
a(n) = (k-n+1)^n + (k-n+2)^n + ... + (k-1)^n + k^n, where k = n(n+1)/2.
- Smallest number with a prime signature whose indices are the decimal digits of n.A069877
Smallest number with a prime signature whose indices are the decimal digits of n.
- Number of partitions of 10^n into distinct parts.A069878
Number of partitions of 10^n into distinct parts.
- Number of pairs {i,j} with i different from j; 1<=i<=n; 1<= j <=n such that i+j is a prime number.A069879
Number of pairs {i,j} with i different from j; 1<=i<=n; 1<= j <=n such that i+j is a prime number.
- Number of terms in the simple continued fraction for Sum_{k=1..n} 1/k!.A069880
Number of terms in the simple continued fraction for Sum_{k=1..n} 1/k!.
- Numbers n such that n and 2n+1 are both palindromes.A069881
Numbers n such that n and 2n+1 are both palindromes.
- Numbers n such that n and 2n-1 are both palindromes.A069882
Numbers n such that n and 2n-1 are both palindromes.
- Smallest nontrivial palindromic n-th perfect power (a(n) >1 for n>1).A069883
Smallest nontrivial palindromic n-th perfect power (a(n) >1 for n>1).
- Smallest nontrivial palindromic n-th perfect power such that a(n)^(1/n) is different for different values of n.A069884
Smallest nontrivial palindromic n-th perfect power such that a(n)^(1/n) is different for different values of n.
- Duplicate of A069748.A069885
Duplicate of A069748.
- Smallest multiple of n starting with 1 with descending digit string (a left substring of 10987654321098...), 0 if no such number exists.A069886
Smallest multiple of n starting with 1 with descending digit string (a left substring of 10987654321098...), 0 if no such number exists.
- Number of terms in the simple continued fraction expansion for (1+1/n)^n.A069887
Number of terms in the simple continued fraction expansion for (1+1/n)^n.
- Self-inverse permutation of natural numbers induced by the automorphism DeepReverse_et_RotateHandshakes! acting on the parenthesizations encoded by A014486.A069888
Self-inverse permutation of natural numbers induced by the automorphism DeepReverse_et_RotateHandshakes! acting on the parenthesizations encoded by A014486.
- Self-inverse permutation of natural numbers induced by the automorphism RotateHandshakes_et_DeepReverse! acting on the parenthesizations encoded by A014486.A069889
Self-inverse permutation of natural numbers induced by the automorphism RotateHandshakes_et_DeepReverse! acting on the parenthesizations encoded by A014486.
- Smallest odd number k such that p(2m)-2p(m)=k has exactly n solutions (where p(m) = m-th prime).A069890
Smallest odd number k such that p(2m)-2p(m)=k has exactly n solutions (where p(m) = m-th prime).
- a(n) = Sum_{k=1..n} A007913(k), the squarefree part of k.A069891
a(n) = Sum_{k=1..n} A007913(k), the squarefree part of k.
- Sequence around outside of single zero roulette wheel.A069892
Sequence around outside of single zero roulette wheel.
- Sequence around outside of double zero roulette wheel.A069893
Sequence around outside of double zero roulette wheel.
- Centered square numbers: a(n) = 4*n^2 + 4*n + 2.A069894
Centered square numbers: a(n) = 4*n^2 + 4*n + 2.
- 2^a(n) divides (2n)^(2n): exponent of 2 in (2n)^(2n).A069895
2^a(n) divides (2n)^(2n): exponent of 2 in (2n)^(2n).
- GCD of consecutive values of Chowla's function.A069896
GCD of consecutive values of Chowla's function.
- Integer quotient of the largest and the smallest prime factors of n, with a(1) = 1.A069897
Integer quotient of the largest and the smallest prime factors of n, with a(1) = 1.
- Smallest of the largest prime divisors of all the composite numbers between prime(n) and prime(n+1).A069898
Smallest of the largest prime divisors of all the composite numbers between prime(n) and prime(n+1).
- Numbers k such that the integer quotient of largest and smallest prime factors of k is 1.A069899
Numbers k such that the integer quotient of largest and smallest prime factors of k is 1.
- Numbers k such that the integer quotient of largest and smallest prime factors of k is greater than one.A069900
Numbers k such that the integer quotient of largest and smallest prime factors of k is greater than one.
- Smallest prime factor of n-th triangular number.A069901
Smallest prime factor of n-th triangular number.
- Largest prime factor of n(n+1)/2, the n-th triangular number.A069902
Largest prime factor of n(n+1)/2, the n-th triangular number.
- Number of distinct prime factors of n-th triangular number.A069903
Number of distinct prime factors of n-th triangular number.
- Number of prime factors of n-th triangular number (with multiplicity).A069904
Number of prime factors of n-th triangular number (with multiplicity).
- Number of partitions of n into 3 positive parts.A069905
Number of partitions of n into 3 positive parts.
- Number of pentagons that can be formed with perimeter n. In other words, number of partitions of n into five parts such that the sum of any four is more than the fifth.A069906
Number of pentagons that can be formed with perimeter n. In other words, number of partitions of n into five parts such that the sum of any four is more than the fifth.
- Number of hexagons that can be formed with perimeter n. In other words, partitions of n into six parts such that the sum of any 5 is more than the sixth.A069907
Number of hexagons that can be formed with perimeter n. In other words, partitions of n into six parts such that the sum of any 5 is more than the sixth.
- Numbers congruent to +-2, +-3, +-4 or +-5 mod 16.A069908
Numbers congruent to +-2, +-3, +-4 or +-5 mod 16.
- Numbers congruent to +-1, +-4, +-6, +-7 mod 16.A069909
Numbers congruent to +-1, +-4, +-6, +-7 mod 16.
- Expansion of Product_{i in A069908} 1/(1 - x^i).A069910
Expansion of Product_{i in A069908} 1/(1 - x^i).