Sequences
392,541 sequences
- Duplicate of A030283.A081511
Duplicate of A030283.
- a(n) = smallest number which can be expressed as the sum of n of its distinct divisors, or 0 if no such number exists.A081512
a(n) = smallest number which can be expressed as the sum of n of its distinct divisors, or 0 if no such number exists.
- a(2)=0; for n != 2, let m = A081512(n), then a(n) = value of d_n in the lexicographically earliest set of n distinct divisors d_1, ..., d_n of m with d_1 + ... + d_n = m.A081513
a(2)=0; for n != 2, let m = A081512(n), then a(n) = value of d_n in the lexicographically earliest set of n distinct divisors d_1, ..., d_n of m with d_1 + ... + d_n = m.
- Triangle read by rows: row n = lexicographically earliest choice for n distinct divisors of A081512(n) = m whose sum is m.A081514
Triangle read by rows: row n = lexicographically earliest choice for n distinct divisors of A081512(n) = m whose sum is m.
- Sum of terms in n-th row of A081517.A081515
Sum of terms in n-th row of A081517.
- Final term in n-th row of A081517.A081516
Final term in n-th row of A081517.
- Consider the smallest number m which can be expressed as the sum of n distinct numbers coprime to m. Sequence gives triangle (read by rows) of the set of coprime numbers pertaining to m. When there is a choice, use the lexicographically earliest solution.A081517
Consider the smallest number m which can be expressed as the sum of n distinct numbers coprime to m. Sequence gives triangle (read by rows) of the set of coprime numbers pertaining to m. When there is a choice, use the lexicographically earliest solution.
- Final term in row n of A081520.A081518
Final term in row n of A081520.
- Sum of terms in row n of A081520.A081519
Sum of terms in row n of A081520.
- Triangle read by rows in which row n consists of 1 and the n-1 smallest positive numbers having common factors with n.A081520
Triangle read by rows in which row n consists of 1 and the n-1 smallest positive numbers having common factors with n.
- Triangle read by rows: row n contains n terms in increasing order, relatively prime to n, whose sum is a multiple of n and such that the row contains the smallest possible subset of consecutive numbers starting with 1.A081521
Triangle read by rows: row n contains n terms in increasing order, relatively prime to n, whose sum is a multiple of n and such that the row contains the smallest possible subset of consecutive numbers starting with 1.
- Last term in row n of A081521.A081522
Last term in row n of A081521.
- Sum of terms in row n of A081521.A081523
Sum of terms in row n of A081521.
- a(n) = A081523(n)/n.A081524
a(n) = A081523(n)/n.
- Erroneous version of A027612.A081525
Erroneous version of A027612.
- Erroneous version of A027611.A081526
Erroneous version of A027611.
- Erroneous version of A022819.A081527
Erroneous version of A022819.
- a(n) = n*lcm{1,2,...,n}.A081528
a(n) = n*lcm{1,2,...,n}.
- Duplicate of A002944.A081529
Duplicate of A002944.
- a(n) = running sum of the first n harmonic numbers, multiplied by the LCM of 1..n.A081530
a(n) = running sum of the first n harmonic numbers, multiplied by the LCM of 1..n.
- Primes p such that (r-p)/log(p) > 2, where r is the next prime after p.A081531
Primes p such that (r-p)/log(p) > 2, where r is the next prime after p.
- Triangle read by rows: let m be smallest number with n divisors, then row n gives divisors of m.A081532
Triangle read by rows: let m be smallest number with n divisors, then row n gives divisors of m.
- Sum of terms in row n of A081532.A081533
Sum of terms in row n of A081532.
- Numbers k such that 1 + 2 ... + k divides lcm(1,2,...,k), or, in other words, lcm(1,2,...,k) is a multiple of the k-th triangular number.A081534
Numbers k such that 1 + 2 ... + k divides lcm(1,2,...,k), or, in other words, lcm(1,2,...,k) is a multiple of the k-th triangular number.
- Sum of row n of triangle in A081536.A081535
Sum of row n of triangle in A081536.
- Let f(n) be smallest number k which is a sum of n distinct numbers whose LCM is a multiple of k. Sequence gives triangle read by rows in which n-th row consists of those n numbers (row 2 is 0, 0 by convention).A081536
Let f(n) be smallest number k which is a sum of n distinct numbers whose LCM is a multiple of k. Sequence gives triangle read by rows in which n-th row consists of those n numbers (row 2 is 0, 0 by convention).
- LCM of row n of triangle in A081536.A081537
LCM of row n of triangle in A081536.
- a(n) = A081537(n)/A081535(n), with a(2) = 1 by convention.A081538
a(n) = A081537(n)/A081535(n), with a(2) = 1 by convention.
- Triangle read by rows in which the n-th row contains the n numbers in increasing order formed by the concatenation of first n-1 numbers. (The digits of the numbers with 2 or more digits are taken as one entity.) First row is taken to be 0.A081539
Triangle read by rows in which the n-th row contains the n numbers in increasing order formed by the concatenation of first n-1 numbers. (The digits of the numbers with 2 or more digits are taken as one entity.) First row is taken to be 0.
- Sum of terms in row n of A081539.A081540
Sum of terms in row n of A081539.
- Triangle read by rows: the n-th row contains n numbers sorted in decreasing value, each build by dropping a different number from the sequence [n,n-1,n-2,....,1] and concatenating the n-1 others. By definition the first row contains 0.A081541
Triangle read by rows: the n-th row contains n numbers sorted in decreasing value, each build by dropping a different number from the sequence [n,n-1,n-2,....,1] and concatenating the n-1 others. By definition the first row contains 0.
- Row sums of A081541.A081542
Row sums of A081541.
- G.f.: Sum_{k >= 1} x^k/(1-x^k)^(k+1).A081543
G.f.: Sum_{k >= 1} x^k/(1-x^k)^(k+1).
- Decimal expansion of Sum_(1/(2^q-1)) with the summation extending over all pairs of integers gcd(p,q) = 1, 0 < p/q < phi, where phi is the Golden ratio.A081544
Decimal expansion of Sum_(1/(2^q-1)) with the summation extending over all pairs of integers gcd(p,q) = 1, 0 < p/q < phi, where phi is the Golden ratio.
- Smallest prime which is 1 more than the product of n distinct composite numbers.A081545
Smallest prime which is 1 more than the product of n distinct composite numbers.
- Smallest prime which is 1 more than the product of n (not necessarily distinct) composite numbers.A081546
Smallest prime which is 1 more than the product of n (not necessarily distinct) composite numbers.
- Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.A081547
Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.
- Smallest composite number which is 1 more than the product of n distinct primes.A081548
Smallest composite number which is 1 more than the product of n distinct primes.
- a(1) = 1; for n > 1, a(n) > a(n-1) is the smallest number such that the concatenation a(1)a(2)a(3)... forms a cyclic concatenation of 123456789 (of nonzero digits).A081549
a(1) = 1; for n > 1, a(n) > a(n-1) is the smallest number such that the concatenation a(1)a(2)a(3)... forms a cyclic concatenation of 123456789 (of nonzero digits).
- Decimal expansion of Sum_(1/(2^q-1)) with the summation extending over all pairs of integers gcd(p,q) = 1, 0 < p/q < Pi.A081550
Decimal expansion of Sum_(1/(2^q-1)) with the summation extending over all pairs of integers gcd(p,q) = 1, 0 < p/q < Pi.
- Triangle, read by rows, in which the n-th row contains n smallest n-digit numbers.A081551
Triangle, read by rows, in which the n-th row contains n smallest n-digit numbers.
- Leading terms of rows in A081551.A081552
Leading terms of rows in A081551.
- Sum of n-th row of A081551.A081553
Sum of n-th row of A081551.
- a(n) = sqrt(2)*( (3+2*sqrt(2))^n - (3-2*sqrt(2))^n ).A081554
a(n) = sqrt(2)*( (3+2*sqrt(2))^n - (3-2*sqrt(2))^n ).
- a(n) = 6*a(n-1) - a(n-2) - 4, a(0)=3, a(1)=7.A081555
a(n) = 6*a(n-1) - a(n-2) - 4, a(0)=3, a(1)=7.
- Next-to-last term in n-th row of A080504.A081556
Next-to-last term in n-th row of A080504.
- Binomial transform of expansion of exp(cosh(x)), A005046.A081557
Binomial transform of expansion of exp(cosh(x)), A005046.
- Exponential generating function: exp(cosh(x)+2*x-1).A081558
Exponential generating function: exp(cosh(x)+2*x-1).
- Expansion of e.g.f.: exp(cosh(2*x)-1), even powers only.A081559
Expansion of e.g.f.: exp(cosh(2*x)-1), even powers only.
- Binomial transform of expansion of exp(cosh(2*x)).A081560
Binomial transform of expansion of exp(cosh(2*x)).