Sequences
392,541 sequences
- a(n) is the least integer x such that there exists an integer in the open interval (x/(i+1), x/i) for i= n-1, n-2 ..., 3, 2, 1.A071111
a(n) is the least integer x such that there exists an integer in the open interval (x/(i+1), x/i) for i= n-1, n-2 ..., 3, 2, 1.
- Smallest k such that the number of elements in the continued fraction for (1+1/k)^k is >= n.A071112
Smallest k such that the number of elements in the continued fraction for (1+1/k)^k is >= n.
- Numbers k such that the number of terms in the continued fraction for (1 + 1/x)^x equals k for some x.A071113
Numbers k such that the number of terms in the continued fraction for (1 + 1/x)^x equals k for some x.
- Numbers n such that n and sigma(n) are prime powers (of the form p^k, p prime, k>=1).A071114
Numbers n such that n and sigma(n) are prime powers (of the form p^k, p prime, k>=1).
- a(1) = 1; a(n+1) is the smallest integer > 0 that cannot be obtained from the integers {a(1), ..., a(n)} using each number at most once and the operators +, -, *, /, where intermediate subexpressions must be integers.A071115
a(1) = 1; a(n+1) is the smallest integer > 0 that cannot be obtained from the integers {a(1), ..., a(n)} using each number at most once and the operators +, -, *, /, where intermediate subexpressions must be integers.
- Least m such that sigma(n + phi(m)) = sigma(phi(m)).A071116
Least m such that sigma(n + phi(m)) = sigma(phi(m)).
- Numbers k such that the sum of the first k digits of the decimal expansion of e is prime.A071117
Numbers k such that the sum of the first k digits of the decimal expansion of e is prime.
- Size of the automorphism group of the group Z X Z_n.A071118
Size of the automorphism group of the group Z X Z_n.
- Palindromic primes in which deleting the outside pair of digits yields a prime at every stage until finally a single-digit prime is obtained.A071119
Palindromic primes in which deleting the outside pair of digits yields a prime at every stage until finally a single-digit prime is obtained.
- Decimal expansion of Sum_{n >= 1} 1/S(n)!, where S(n) is the Kempner number A002034.A071120
Decimal expansion of Sum_{n >= 1} 1/S(n)!, where S(n) is the Kempner number A002034.
- a(n) = a(n-1) + sum of decimal digits of n^3.A071121
a(n) = a(n-1) + sum of decimal digits of n^3.
- a(n) = a(n-1) + sum of decimal digits of 2^n.A071122
a(n) = a(n-1) + sum of decimal digits of 2^n.
- a(n) = a(n-1) + sum of decimal digits of n!.A071123
a(n) = a(n-1) + sum of decimal digits of n!.
- Least of five consecutive numbers which are cubefree and not squarefree, i.e., {k, k+1, k+2, k+3, k+4} are in A067259.A071124
Least of five consecutive numbers which are cubefree and not squarefree, i.e., {k, k+1, k+2, k+3, k+4} are in A067259.
- Least starting number initiating cubefree but nonsquarefree chain of consecutive integers with length n {j,j+1,...,j+n-1}; i.e., start of n consecutive numbers in A067259.A071125
Least starting number initiating cubefree but nonsquarefree chain of consecutive integers with length n {j,j+1,...,j+n-1}; i.e., start of n consecutive numbers in A067259.
- Length of least repunit which is a multiple of the n-th prime, or 0 if no such multiple exists.A071126
Length of least repunit which is a multiple of the n-th prime, or 0 if no such multiple exists.
- Number of times there is a prime p < n such that 2n+p is prime.A071127
Number of times there is a prime p < n such that 2n+p is prime.
- Squares which repeat with at least two full periods when written in base 2.A071128
Squares which repeat with at least two full periods when written in base 2.
- Squares which repeat with at least two full periods when written in base 3.A071129
Squares which repeat with at least two full periods when written in base 3.
- Squares which repeat with at least two full periods when written in base 4.A071130
Squares which repeat with at least two full periods when written in base 4.
- Squares which repeat with at least two full periods when written in base 5.A071131
Squares which repeat with at least two full periods when written in base 5.
- Squares which repeat with at least two full periods when written in base 6.A071132
Squares which repeat with at least two full periods when written in base 6.
- Squares which repeat with at least two full periods when written in base 7.A071133
Squares which repeat with at least two full periods when written in base 7.
- Squares which repeat with at least two full periods when written in base 8.A071134
Squares which repeat with at least two full periods when written in base 8.
- Squares which repeat with at least two full periods when written in base 9.A071135
Squares which repeat with at least two full periods when written in base 9.
- Number of reduced positive-definite ternary forms of determinant -n.A071136
Number of reduced positive-definite ternary forms of determinant -n.
- Number of times 2n+p is prime, with p=1 or prime p < n.A071137
Number of times 2n+p is prime, with p=1 or prime p < n.
- CONTINUANT transform of {sigma(n)}, 1, 3, 4, 7, 6, 12, ... (A000203).A071138
CONTINUANT transform of {sigma(n)}, 1, 3, 4, 7, 6, 12, ... (A000203).
- Numbers k such that the sum of distinct primes dividing k is divisible by the largest prime dividing k.A071139
Numbers k such that the sum of distinct primes dividing k is divisible by the largest prime dividing k.
- Numbers n such that sum of distinct primes dividing n is divisible by largest prime dividing n; n is neither a prime, nor a true power of prime.A071140
Numbers n such that sum of distinct primes dividing n is divisible by largest prime dividing n; n is neither a prime, nor a true power of prime.
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n is neither a prime, nor a true power of prime and n is squarefree. Squarefree solutions of A071140.A071141
Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n is neither a prime, nor a true power of prime and n is squarefree. Squarefree solutions of A071140.
- Numbers of the form 2*p*q where (p,q) is a twin prime pair.A071142
Numbers of the form 2*p*q where (p,q) is a twin prime pair.
- Numbers n such that (i) the sum of the distinct primes dividing n is divisible by the largest prime dividing n and (ii) n has exactly 4 distinct prime factors and (iii) n is squarefree.A071143
Numbers n such that (i) the sum of the distinct primes dividing n is divisible by the largest prime dividing n and (ii) n has exactly 4 distinct prime factors and (iii) n is squarefree.
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 5 distinct prime factors and n is squarefree.A071144
Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 5 distinct prime factors and n is squarefree.
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 6 distinct prime factors and n is squarefree.A071145
Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 6 distinct prime factors and n is squarefree.
- Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 7 distinct prime factors and n is squarefree.A071146
Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 7 distinct prime factors and n is squarefree.
- Smallest squarefree number k with exactly n prime factors such that the sum of the prime factors is divisible by the largest prime dividing k, or 0 if no such k exists.A071147
Smallest squarefree number k with exactly n prime factors such that the sum of the prime factors is divisible by the largest prime dividing k, or 0 if no such k exists.
- Partial sums of sequence of odd primes (A065091); a(n) = sum of the first n odd primes.A071148
Partial sums of sequence of odd primes (A065091); a(n) = sum of the first n odd primes.
- Numbers n such that the sum of the first n odd primes (A071148) is prime; analogous to A013916.A071149
Numbers n such that the sum of the first n odd primes (A071148) is prime; analogous to A013916.
- Primes p such that the sum of all odd primes <= p is also a prime.A071150
Primes p such that the sum of all odd primes <= p is also a prime.
- Primes which are the sum of the first k odd primes for some k.A071151
Primes which are the sum of the first k odd primes for some k.
- Łukasiewicz words for the rooted plane binary trees (interpretation d in Stanley's exercise 19) with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.A071152
Łukasiewicz words for the rooted plane binary trees (interpretation d in Stanley's exercise 19) with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.
- Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.A071153
Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0.
- Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero.A071154
Totally balanced decimal numbers: if we assign the weight w(d) = d-1 to each digit d (i.e., w(0) = -1, w(1) = 0, ..., w(9) = 8) and then read the digits of the term from left to right, the partial sum of the weights is never negative and the total weighted sum is zero.
- The Catalan factorial walks (for each rooted plane tree encoded by A014486) encoded as zero-free numbers in factorial base (A007623).A071155
The Catalan factorial walks (for each rooted plane tree encoded by A014486) encoded as zero-free numbers in factorial base (A007623).
- Apart from the initial term (0), lists all integers whose factorial expansion ends with 1 (i.e., are odd numbers), do not contain a digit zero and each successive digit to the left is at most one greater than the preceding digit.A071156
Apart from the initial term (0), lists all integers whose factorial expansion ends with 1 (i.e., are odd numbers), do not contain a digit zero and each successive digit to the left is at most one greater than the preceding digit.
- The zero-free, right-to-left factorial walk encoding for each rooted plane tree encoded by A014486. Sequence A071155 shown with factorial expansion (A007623).A071157
The zero-free, right-to-left factorial walk encoding for each rooted plane tree encoded by A014486. Sequence A071155 shown with factorial expansion (A007623).
- Factorial expansion of A071156.A071158
Factorial expansion of A071156.
- Integers whose decimal expansion start with 1, do not contain zeros and each successive digit to the right is at most one greater than the previous digit.A071159
Integers whose decimal expansion start with 1, do not contain zeros and each successive digit to the right is at most one greater than the previous digit.
- Łukasiewicz words that are also valid asynchronic siteswap juggling patterns.A071160
Łukasiewicz words that are also valid asynchronic siteswap juggling patterns.