Sequences
392,541 sequences
- Row sums in A082259.A082261
Row sums in A082259.
- Average of row n of A082259.A082262
Average of row n of A082259.
- Triangle A082259 with row n divided by n.A082263
Triangle A082259 with row n divided by n.
- Triangle whose n-th row contains n smallest palindromes with a digit sum of n.A082264
Triangle whose n-th row contains n smallest palindromes with a digit sum of n.
- n-th largest palindrome whose digit sum is n.A082265
n-th largest palindrome whose digit sum is n.
- In the array shown below the n-th row contains all the palindromes that use digits > 0 and have a digit sum of n. The sequence contains the array read by rows.A082266
In the array shown below the n-th row contains all the palindromes that use digits > 0 and have a digit sum of n. The sequence contains the array read by rows.
- Number of palindromes that use nonzero digits and have a digit sum of n.A082267
Number of palindromes that use nonzero digits and have a digit sum of n.
- Triangle read by rows in which the n-th row contains the numbers coprime to n that are made of nonzero digits and having a digit sum of n. An empty row is represented by a 0.A082268
Triangle read by rows in which the n-th row contains the numbers coprime to n that are made of nonzero digits and having a digit sum of n. An empty row is represented by a 0.
- Number of positive terms in row n of A082268.A082269
Number of positive terms in row n of A082268.
- a(1) = 1; for n >= 1, a(n+1) = smallest number not occurring earlier such that a(n)*a(n+1) + 1 is a palindrome.A082270
a(1) = 1; for n >= 1, a(n+1) = smallest number not occurring earlier such that a(n)*a(n+1) + 1 is a palindrome.
- Palindromes arising in A082270.A082271
Palindromes arising in A082270.
- Smallest palindrome m such that n + m (m>0) is also a palindrome, or 0 if no such number exists.A082272
Smallest palindrome m such that n + m (m>0) is also a palindrome, or 0 if no such number exists.
- Palindromes arising in A082272, or 0 if A082272(n) is 0.A082273
Palindromes arising in A082272, or 0 if A082272(n) is 0.
- Palindromes k such that k + 2 is also a palindrome.A082274
Palindromes k such that k + 2 is also a palindrome.
- Palindromes k such that k + 11 is also a palindrome.A082275
Palindromes k such that k + 11 is also a palindrome.
- Smallest number whose digits can be permuted to get exactly n distinct palindromes.A082276
Smallest number whose digits can be permuted to get exactly n distinct palindromes.
- Smallest prime that is the sum of prime(n) consecutive primes.A082277
Smallest prime that is the sum of prime(n) consecutive primes.
- a(1)=1; for n >= 1, a(n+1) is minimal such that there are a(n) primes strictly between a(n) and a(n+1).A082278
a(1)=1; for n >= 1, a(n+1) is minimal such that there are a(n) primes strictly between a(n) and a(n+1).
- a(1)=1, a(2)=2 and a(n+1) is minimal such that there are a(n-1) primes strictly between a(n) and a(n+1).A082279
a(1)=1, a(2)=2 and a(n+1) is minimal such that there are a(n-1) primes strictly between a(n) and a(n+1).
- a(1) = 1, then the smallest number such that there are a(n) composite numbers between a(n) and a(n+1) both excluded.A082280
a(1) = 1, then the smallest number such that there are a(n) composite numbers between a(n) and a(n+1) both excluded.
- a(1) = 1, a(2) = 2; then a(n) = smallest number such that there are a(n-1) composite numbers between a(n) and a(n+1) exclusive.A082281
a(1) = 1, a(2) = 2; then a(n) = smallest number such that there are a(n-1) composite numbers between a(n) and a(n+1) exclusive.
- a(1) = 2, a(n) is the smallest prime > n*a(n-1).A082282
a(1) = 2, a(n) is the smallest prime > n*a(n-1).
- Duplicate of A065867.A082283
Duplicate of A065867.
- a(n) = smallest number k such that k - tau(k) = n, or 0 if no such number exists, where tau(n) = the number of divisors of n (A000005).A082284
a(n) = smallest number k such that k - tau(k) = n, or 0 if no such number exists, where tau(n) = the number of divisors of n (A000005).
- a(n) = 16*n + 13.A082285
a(n) = 16*n + 13.
- a(n) = 18*n + 10.A082286
a(n) = 18*n + 10.
- a(1) = 1; for n > 1, n appears omega(n) times, where omega(n)=A001221(n) is the number of distinct prime factors of n, a(1)=1.A082287
a(1) = 1; for n > 1, n appears omega(n) times, where omega(n)=A001221(n) is the number of distinct prime factors of n, a(1)=1.
- n>1 appears bigomega(n) times, where bigomega(n)=A001222(n) is the number of prime factors of n (with repetition), a(1)=1.A082288
n>1 appears bigomega(n) times, where bigomega(n)=A001222(n) is the number of prime factors of n (with repetition), a(1)=1.
- Expansion of x^4*(2+x)/((1+x)*(1-x)^5).A082289
Expansion of x^4*(2+x)/((1+x)*(1-x)^5).
- Expansion of (1+x+x^2)/((1+x^2)*(1+x)^4*(1-x)^5).A082290
Expansion of (1+x+x^2)/((1+x^2)*(1+x)^4*(1-x)^5).
- Expansion of x(2 + 5x - x^2)/((1 - x)(1 - 6x + x^2)).A082291
Expansion of x(2 + 5x - x^2)/((1 - x)(1 - 6x + x^2)).
- a(n) = (2*n+1) * (2*n)! / (sqrt(4*(n+1)*Product_{k=1..2*n+1} lcm(k, 2*n+2-k))).A082292
a(n) = (2*n+1) * (2*n)! / (sqrt(4*(n+1)*Product_{k=1..2*n+1} lcm(k, 2*n+2-k))).
- Numbers having exactly one square divisor > 1.A082293
Numbers having exactly one square divisor > 1.
- Numbers having exactly two square divisors > 1.A082294
Numbers having exactly two square divisors > 1.
- Numbers having more than two square divisors > 1.A082295
Numbers having more than two square divisors > 1.
- Solutions to 13^x+17^x == 19 mod 23.A082296
Solutions to 13^x+17^x == 19 mod 23.
- Main diagonal of array A083861.A082297
Main diagonal of array A083861.
- Expansion of (1-3*x-sqrt(9*x^2-10*x+1))/(2*x).A082298
Expansion of (1-3*x-sqrt(9*x^2-10*x+1))/(2*x).
- Greatest common divisor of n and its sum of prime factors (with repetition).A082299
Greatest common divisor of n and its sum of prime factors (with repetition).
- Numbers relatively prime to the sum of their prime factors (with repetition).A082300
Numbers relatively prime to the sum of their prime factors (with repetition).
- G.f.: (1 - 4*x - sqrt(16*x^2 - 12*x + 1))/(2*x).A082301
G.f.: (1 - 4*x - sqrt(16*x^2 - 12*x + 1))/(2*x).
- Expansion of g.f.: (1 - 5*x - sqrt(25*x^2 - 14*x + 1))/(2*x).A082302
Expansion of g.f.: (1 - 5*x - sqrt(25*x^2 - 14*x + 1))/(2*x).
- McKay-Thompson series of class 32e for the Monster group.A082303
McKay-Thompson series of class 32e for the Monster group.
- McKay-Thompson series of class 16d for the Monster group.A082304
McKay-Thompson series of class 16d for the Monster group.
- G.f.: (1 - 6*x - sqrt(36*x^2 - 16*x + 1))/(2*x).A082305
G.f.: (1 - 6*x - sqrt(36*x^2 - 16*x + 1))/(2*x).
- Expansion of e.g.f. (1+x)*exp(2*x)*cosh(x).A082306
Expansion of e.g.f. (1+x)*exp(2*x)*cosh(x).
- Expansion of e.g.f. (1+x)*exp(3*x)*cosh(x).A082307
Expansion of e.g.f. (1+x)*exp(3*x)*cosh(x).
- Expansion of e.g.f. (1+x)*exp(4*x)*cosh(x).A082308
Expansion of e.g.f. (1+x)*exp(4*x)*cosh(x).
- Expansion of e.g.f.: (1+x)*exp(5*x)*cosh(x).A082309
Expansion of e.g.f.: (1+x)*exp(5*x)*cosh(x).
- Duplicate of A015565.A082310
Duplicate of A015565.