Sequences
392,541 sequences
- 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 label k of the root.A071211
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 label k of the root.
- Number of labeled cyclic trees with n nodes such that the root is smaller than all its children.A071212
Number of labeled cyclic trees with n nodes such that the root is smaller than all its children.
- Number of labeled planar trees with n nodes such that the root is smaller than all its children.A071213
Number of labeled planar trees with n nodes such that the root is smaller than all its children.
- Number of labeled ordered trees with n nodes such that the root is smaller than all its children.A071214
Number of labeled ordered trees with n nodes such that the root is smaller than all its children.
- Number of distinct prime factors of sum of 2 successive primes.A071215
Number of distinct prime factors of sum of 2 successive primes.
- a(n) is the largest prime factor of prime(n) + prime(n+1).A071216
a(n) is the largest prime factor of prime(n) + prime(n+1).
- Numbers k such that the largest prime factor of the sum of successive primes p(k) + p(k+1) is greater than k.A071217
Numbers k such that the largest prime factor of the sum of successive primes p(k) + p(k+1) is greater than k.
- Numbers k such that the largest prime factor of the sum of the two consecutive primes prime(k) + prime(k+1) is at most k.A071218
Numbers k such that the largest prime factor of the sum of the two consecutive primes prime(k) + prime(k+1) is at most k.
- Numbers m such that the largest prime factor of prime(m) + prime(m+1) equals m.A071219
Numbers m such that the largest prime factor of prime(m) + prime(m+1) equals m.
- Numbers n such that prime(n) + prime(n+1) is a cube.A071220
Numbers n such that prime(n) + prime(n+1) is a cube.
- Product of next n composite numbers.A071221
Product of next n composite numbers.
- Smallest k such that gcd(n,k) = gcd(n+1,k+1).A071222
Smallest k such that gcd(n,k) = gcd(n+1,k+1).
- Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: number of linearly inducible orderings of n points in k-dimensional Euclidean space.A071223
Triangle T(n,k) (n >= 2, 1 <= k <= n) read by rows: number of linearly inducible orderings of n points in k-dimensional Euclidean space.
- LCM of n and n-th composite number.A071224
LCM of n and n-th composite number.
- n-th power of the product of next n primes.A071225
n-th power of the product of next n primes.
- n-th power of the product of next n natural numbers.A071226
n-th power of the product of next n natural numbers.
- Number of solutions 1<=x<=m to gcd(m,x) = tau(m) where m = A033950(n).A071227
Number of solutions 1<=x<=m to gcd(m,x) = tau(m) where m = A033950(n).
- a(n) = n*(n-th composite number).A071228
a(n) = n*(n-th composite number).
- a(n) = n*(14*n^2 - 21*n + 13)/6.A071229
a(n) = n*(14*n^2 - 21*n + 13)/6.
- a(n) = n*(6*n^2 - 7*n + 3)/2.A071230
a(n) = n*(6*n^2 - 7*n + 3)/2.
- a(n) = (n^8 + n^4)/2.A071231
a(n) = (n^8 + n^4)/2.
- a(n) = (n^6 + n^3)/2.A071232
a(n) = (n^6 + n^3)/2.
- a(n) = 2*(n-1)*(n^2 + 1).A071233
a(n) = 2*(n-1)*(n^2 + 1).
- Smallest prime beginning and ending in 2n+1 or 0 if no such prime exists.A071234
Smallest prime beginning and ending in 2n+1 or 0 if no such prime exists.
- a(n) = (n^12 + n^6)/2.A071235
a(n) = (n^12 + n^6)/2.
- a(n) = (n^10 + n^5)/2.A071236
a(n) = (n^10 + n^5)/2.
- a(n) = n*(n+1)*(n^2+1)/2.A071237
a(n) = n*(n+1)*(n^2+1)/2.
- a(n) = n*(n+1)*(2*n^2+1)/6.A071238
a(n) = n*(n+1)*(2*n^2+1)/6.
- a(n) = n*(n+1)*(n^2 + 2)/6.A071239
a(n) = n*(n+1)*(n^2 + 2)/6.
- Arithmetic mean of k and R(k) where k is a number using only odd digits and R(k) is its digit reversal (A004086).A071240
Arithmetic mean of k and R(k) where k is a number using only odd digits and R(k) is its digit reversal (A004086).
- Arithmetic mean of k and R(k) where k is the n-th nonnegative number using only even digits and R(k) is its digit reversal (A004086).A071241
Arithmetic mean of k and R(k) where k is the n-th nonnegative number using only even digits and R(k) is its digit reversal (A004086).
- Arithmetic mean of n and R(n) where n is a number such that the least significant digit and the most significant digits are of same parity and R(n) is its digit reversal (A004086).A071242
Arithmetic mean of n and R(n) where n is a number such that the least significant digit and the most significant digits are of same parity and R(n) is its digit reversal (A004086).
- Record terms in A005179.A071243
Record terms in A005179.
- a(n) = n*(n-1)*(n^2 + 2)/6.A071244
a(n) = n*(n-1)*(n^2 + 2)/6.
- a(n) = n*(n-1)*(2*n^2 + 1)/6.A071245
a(n) = n*(n-1)*(2*n^2 + 1)/6.
- a(n) = n*(n - 1)*(2*n^2 + n + 2)/6.A071246
a(n) = n*(n - 1)*(2*n^2 + n + 2)/6.
- Numbers n such that A078142(n) = A078142(n+1), where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.A071247
Numbers n such that A078142(n) = A078142(n+1), where A078142(n) is the sum of the differences of the distinct prime factors p of n and the next square larger than p.
- a(n) = Product_{k=1..n} lcm(n,k).A071248
a(n) = Product_{k=1..n} lcm(n,k).
- Numbers k such that gcd(k, R(k)) > 1, where R(k) (A004086) is the digit reversal of k.A071249
Numbers k such that gcd(k, R(k)) > 1, where R(k) (A004086) is the digit reversal of k.
- Palindromes with successive increasing difference: a(k)-a(k-1) > a(k+1)- a(k).A071250
Palindromes with successive increasing difference: a(k)-a(k-1) > a(k+1)- a(k).
- Squarefree palindromes.A071251
Squarefree palindromes.
- a(n) = n*(n - 1)*(n^2 + 1)/2.A071252
a(n) = n*(n - 1)*(n^2 + 1)/2.
- a(n) = n^2*(n^2+1).A071253
a(n) = n^2*(n^2+1).
- Duplicate of A063528.A071254
Duplicate of A063528.
- a(1) = 2, a(n+1) = a(n)-th squarefree number > 1.A071255
a(1) = 2, a(n+1) = a(n)-th squarefree number > 1.
- Smallest multiple of n sandwiched between twin primes.A071256
Smallest multiple of n sandwiched between twin primes.
- Duplicate of A067392.A071257
Duplicate of A067392.
- a(1) = 4; a(n) = smallest composite number of form k*a(n-1) + 1 with k > 1.A071258
a(1) = 4; a(n) = smallest composite number of form k*a(n-1) + 1 with k > 1.
- Integer part of the arithmetic mean of the n-th prime p(n) and the n-th composite number C(n).A071259
Integer part of the arithmetic mean of the n-th prime p(n) and the n-th composite number C(n).
- Integer part of the geometric mean of the n-th prime prime(n) and the n-th composite number C(n).A071260
Integer part of the geometric mean of the n-th prime prime(n) and the n-th composite number C(n).