Sequences
392,541 sequences
- Integers whose decimal expansion satisfies the condition that if we read each term from the left to right (the most significant to the least significant digit) then each nonzero digit gives a distance to the next nonzero digit to right (with a cyclic wrap-over from the least-significant to the most significant nonzero digit).A071161
Integers whose decimal expansion satisfies the condition that if we read each term from the left to right (the most significant to the least significant digit) then each nonzero digit gives a distance to the next nonzero digit to right (with a cyclic wrap-over from the least-significant to the most significant nonzero digit).
- Simple rewriting of binary expansion of n resulting A014486-codes for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf).A071162
Simple rewriting of binary expansion of n resulting A014486-codes for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf).
- A014486-indices for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf.)A071163
A014486-indices for rooted binary trees with height equal to number of internal vertices. (Binary trees where at each internal vertex at least the other child is leaf.)
- Square array read by antidiagonals of T(n,k)=T(n-1,k-n)+T(n-k,k-1) starting with T(n,k)=0 if either n or k are negative but with T(0,0)=1.A071164
Square array read by antidiagonals of T(n,k)=T(n-1,k-n)+T(n-k,k-1) starting with T(n,k)=0 if either n or k are negative but with T(0,0)=1.
- Row (or column) sums of A071164.A071165
Row (or column) sums of A071164.
- a(n) = n - A006530(A000203(n)), difference between n and largest prime factor of the sum of its divisors.A071166
a(n) = n - A006530(A000203(n)), difference between n and largest prime factor of the sum of its divisors.
- a(n) = A023194 - A062700(n). Negative values of A071166(m) = m-A006530(A000203(m)) differences. In these cases m is square number from A023194.A071167
a(n) = A023194 - A062700(n). Negative values of A071166(m) = m-A006530(A000203(m)) differences. In these cases m is square number from A023194.
- n-th prime reduced modulo phi(n).A071168
n-th prime reduced modulo phi(n).
- a(n) is the smallest number k such that prime(k) == 2*n-1 (mod phi(k)).A071169
a(n) is the smallest number k such that prime(k) == 2*n-1 (mod phi(k)).
- n-th prime reduced modulo sigma(n).A071170
n-th prime reduced modulo sigma(n).
- L_2 norm of vertices of Permuto-Associahedron in R^n.A071171
L_2 norm of vertices of Permuto-Associahedron in R^n.
- Number of squarefree integers <= 10^n.A071172
Number of squarefree integers <= 10^n.
- Nonprimes which terminate in their sum of prime factors.A071173
Nonprimes which terminate in their sum of prime factors.
- Numbers whose sum of exponents is equal to the product of prime factors.A071174
Numbers whose sum of exponents is equal to the product of prime factors.
- Numbers whose product of exponents is equal to the sum of prime factors.A071175
Numbers whose product of exponents is equal to the sum of prime factors.
- Smallest k such that the concatenation of n and k is a square (decimal notation).A071176
Smallest k such that the concatenation of n and k is a square (decimal notation).
- Square-root of concatenation n'k, where k is minimal with n'k square (decimal notation).A071177
Square-root of concatenation n'k, where k is minimal with n'k square (decimal notation).
- Exponent of the largest prime factor of n.A071178
Exponent of the largest prime factor of n.
- n - (sum of prime factors of n) is prime.A071179
n - (sum of prime factors of n) is prime.
- Number of numbers m with n < m <= n^2 containing n in decimal representation.A071180
Number of numbers m with n < m <= n^2 containing n in decimal representation.
- Number of numbers k such that phi(k) divides phi(n).A071181
Number of numbers k such that phi(k) divides phi(n).
- SPF(n+1)-SPF(n), where SPF(n) denotes the smallest prime factor of n.A071182
SPF(n+1)-SPF(n), where SPF(n) denotes the smallest prime factor of n.
- a(1)=1; a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.A071183
a(1)=1; a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n^2.
- a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n*(n+1)/2 the n-th triangular number.A071184
a(1)=1, a(n) is the smallest integer > a(n-1) such that the sum of elements of the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals n*(n+1)/2 the n-th triangular number.
- Smallest k such that prime(k*n)-k*prime(n) is prime.A071185
Smallest k such that prime(k*n)-k*prime(n) is prime.
- Numbers k such that prime(2*k)-2*prime(k) is prime.A071186
Numbers k such that prime(2*k)-2*prime(k) is prime.
- Smallest prime factor of number of divisors of n; a(1) = 1.A071187
Smallest prime factor of number of divisors of n; a(1) = 1.
- Largest prime factor of number of divisors of n; a(1)=1.A071188
Largest prime factor of number of divisors of n; a(1)=1.
- Smallest prime factor of sum of divisors of n.A071189
Smallest prime factor of sum of divisors of n.
- Greatest prime factor of sum of divisors of n, for n >= 2; a(1) = 1.A071190
Greatest prime factor of sum of divisors of n, for n >= 2; a(1) = 1.
- Least m>n such that the number of prime factors of m and n differ at most by 1.A071191
Least m>n such that the number of prime factors of m and n differ at most by 1.
- Least m>n such that the number of prime factors of m and n differ by 1.A071192
Least m>n such that the number of prime factors of m and n differ by 1.
- Least m > n such that bigomega(m) != bigomega(n), where bigomega(n) = A001222(n).A071193
Least m > n such that bigomega(m) != bigomega(n), where bigomega(n) = A001222(n).
- Length (>1) of shortest sequence of consecutive primes starting with prime(n) whose sum is also prime, or -1 if no such sequence exists.A071194
Length (>1) of shortest sequence of consecutive primes starting with prime(n) whose sum is also prime, or -1 if no such sequence exists.
- Final prime in sequence of primes starting with prime(n) and having prime sum (see A071194), or -1 if no such sequence exists.A071195
Final prime in sequence of primes starting with prime(n) and having prime sum (see A071194), or -1 if no such sequence exists.
- The sum of the sequence starting with prime(n) and having prime sum defined in A071194, or -1 if no such sequence exists.A071196
The sum of the sequence starting with prime(n) and having prime sum defined in A071194, or -1 if no such sequence exists.
- Possible prime values in A071195.A071197
Possible prime values in A071195.
- Impossible primes in A071195. These primes are not terminal primes of shortest consecutive prime sequences initiated with n-th prime and providing prime-sum.A071198
Impossible primes in A071195. These primes are not terminal primes of shortest consecutive prime sequences initiated with n-th prime and providing prime-sum.
- Possible primes appearing in A071196 as certain sums of previous consecutive primes. See A071196.A071199
Possible primes appearing in A071196 as certain sums of previous consecutive primes. See A071196.
- Primes which do not appear in A071196.A071200
Primes which do not appear in A071196.
- Array A(n,k) read by antidiagonals giving number of paths up and right from (0,0) to (n,k) where x/y<=n/k.A071201
Array A(n,k) read by antidiagonals giving number of paths up and right from (0,0) to (n,k) where x/y<=n/k.
- Array read by antidiagonals giving number of paths up and left from (0,0) to (n,k) where x/y<n/k (except at start and finish).A071202
Array read by antidiagonals giving number of paths up and left from (0,0) to (n,k) where x/y<n/k (except at start and finish).
- Integer part of n divided by its largest digit (decimal notation).A071203
Integer part of n divided by its largest digit (decimal notation).
- Numbers which are multiples of their largest digit (decimal notation).A071204
Numbers which are multiples of their largest digit (decimal notation).
- Largest digit of A071204(n).A071205
Largest digit of A071204(n).
- A071204(n) divided by its largest digit.A071206
A071204(n) divided by its largest digit.
- Triangular array T(n,k) read by rows, giving number of rooted trees on the vertex set {1..n+1} where k children of the root have a label smaller than the label of the root.A071207
Triangular array T(n,k) read by rows, giving number of rooted trees on the vertex set {1..n+1} where k children of the root have a label smaller than the label of the root.
- Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the number k of decreasing edges.A071208
Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the number k of decreasing edges.
- Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the size k of the subtree rooted at the vertex labeled by 1.A071209
Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the size k of the subtree rooted at the vertex labeled by 1.
- Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.A071210
Triangular array T(n,k) read by rows, giving number of labeled free trees such that the root is smaller than all its children, with respect to the number n of vertices and to the degree k of the root.