Sequences
392,541 sequences
- Alternating runs of ones and zeros, where the n-th run has length n.A057211
Alternating runs of ones and zeros, where the n-th run has length n.
- n-th run has length n.A057212
n-th run has length n.
- Second term of continued fraction for exp(n).A057213
Second term of continued fraction for exp(n).
- Numbers k such that k | 10^k + 9^k + 8^k + 7^k.A057214
Numbers k such that k | 10^k + 9^k + 8^k + 7^k.
- [1->01, 2->10, 3->01]-transform of 3-symbol Thue-Morse A026600.A057215
[1->01, 2->10, 3->01]-transform of 3-symbol Thue-Morse A026600.
- To get next term, multiply by 17, add 1 and discard any prime factors < 17.A057216
To get next term, multiply by 17, add 1 and discard any prime factors < 17.
- a(n) = smallest positive integer k such that 1 + n*k! is a prime.A057217
a(n) = smallest positive integer k such that 1 + n*k! is a prime.
- a(n) = least prime of the form n*k! + 1.A057218
a(n) = least prime of the form n*k! + 1.
- {e^n}-th prime, where {e^n} is closest integer to e^n, A000227.A057219
{e^n}-th prime, where {e^n} is closest integer to e^n, A000227.
- Numbers k such that 2^k - 23 is prime.A057220
Numbers k such that 2^k - 23 is prime.
- Numbers k such that 2^k + 19 is prime.A057221
Numbers k such that 2^k + 19 is prime.
- Number of 4 X n binary matrices with 1 unit column up to row and column permutations.A057222
Number of 4 X n binary matrices with 1 unit column up to row and column permutations.
- Number of 4 X n binary matrices without unit columns up to row and column permutations.A057223
Number of 4 X n binary matrices without unit columns up to row and column permutations.
- Numbers k such that (Product of first k Mersenne prime exponents) + 1 is prime.A057224
Numbers k such that (Product of first k Mersenne prime exponents) + 1 is prime.
- Numbers k such that (Product of first k Mersenne prime exponents) - 1 is prime.A057225
Numbers k such that (Product of first k Mersenne prime exponents) - 1 is prime.
- Number of different symbols needed to express n as a Roman numeral.A057226
Number of different symbols needed to express n as a Roman numeral.
- Smallest member of smallest set S(n) of positive integers containing n which satisfies "k is in S, iff 2k-1 is in S, iff 4k is in S".A057227
Smallest member of smallest set S(n) of positive integers containing n which satisfies "k is in S, iff 2k-1 is in S, iff 4k is in S".
- a(n) = u * v = x * y with (u - v) = (x + y) = A009000(n) (u>v, y>0, v>0, x>0, y>0).A057228
a(n) = u * v = x * y with (u - v) = (x + y) = A009000(n) (u>v, y>0, v>0, x>0, y>0).
- a(n) = a*b = x*y with (a-b) = (x+y) = A020882(n) (a>b, a>0, b>0, x>0, y>0), gcd(a, b) = gcd(x, y) = 1.A057229
a(n) = a*b = x*y with (a-b) = (x+y) = A020882(n) (a>b, a>0, b>0, x>0, y>0), gcd(a, b) = gcd(x, y) = 1.
- Numbers k such that k = p+q = r+s with p*q = r*s = primorial number(A002110) (p*q) < (r*s).A057230
Numbers k such that k = p+q = r+s with p*q = r*s = primorial number(A002110) (p*q) < (r*s).
- Numbers k such that k divides 9^k + 8^k + 7^k.A057231
Numbers k such that k divides 9^k + 8^k + 7^k.
- Numbers k such that k | 10^k + 9^k + 8^k.A057232
Numbers k such that k | 10^k + 9^k + 8^k.
- Numbers n such that n | 8^n + 7^n + 6^n.A057233
Numbers n such that n | 8^n + 7^n + 6^n.
- Numbers n such that n | 7^n + 6^n + 5^n.A057234
Numbers n such that n | 7^n + 6^n + 5^n.
- Numbers n such that n | 6^n + 5^n + 4^n.A057235
Numbers n such that n | 6^n + 5^n + 4^n.
- Numbers n such that n | 5^n + 4^n + 3^n.A057236
Numbers n such that n | 5^n + 4^n + 3^n.
- Maximum k <= n such that 1, 2, ..., k are all relatively prime to n.A057237
Maximum k <= n such that 1, 2, ..., k are all relatively prime to n.
- Numbers k such that k | 4^k + 3^k + 2^k.A057238
Numbers k such that k | 4^k + 3^k + 2^k.
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n.A057239
Numbers n such that n | 12^n + 11^n + 10^n + 9^n.
- Numbers k such that k | 11^k + 10^k + 9^k + 8^k.A057240
Numbers k such that k | 11^k + 10^k + 9^k + 8^k.
- Circuit cost of the hardest Boolean function of n variables; metric: 2-input AND-gates cost 1, NOT is free, fanout is free, inputs are free, no feedback allowed.A057241
Circuit cost of the hardest Boolean function of n variables; metric: 2-input AND-gates cost 1, NOT is free, fanout is free, inputs are free, no feedback allowed.
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n.A057242
Numbers n such that n | 9^n + 8^n + 7^n + 6^n.
- Numbers k that divide 8^k + 7^k + 6^k + 5^k.A057243
Numbers k that divide 8^k + 7^k + 6^k + 5^k.
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n.A057244
Numbers n such that n | 7^n + 6^n + 5^n + 4^n.
- Numbers m such that m | Sum_{k=1..m} k!.A057245
Numbers m such that m | Sum_{k=1..m} k!.
- s=0; d is divisor of n [here d <= n/d]; if gcd(d,n/d)=1 or gcd(d,n/d)=d then s=s+d+(n/d); [if d=n/d then s=s+d]: The sequence contains composite n for which s = 2*n.A057246
s=0; d is divisor of n [here d <= n/d]; if gcd(d,n/d)=1 or gcd(d,n/d)=d then s=s+d+(n/d); [if d=n/d then s=s+d]: The sequence contains composite n for which s = 2*n.
- a(n) is the smallest prime of the form 1 + prime(n)*2^m, with m > 0.A057247
a(n) is the smallest prime of the form 1 + prime(n)*2^m, with m > 0.
- Numbers n such that n | 6^n + 5^n + 4^n + 3^n.A057248
Numbers n such that n | 6^n + 5^n + 4^n + 3^n.
- Numbers k such that k | 5^k + 4^k + 3^k + 2^k.A057249
Numbers k such that k | 5^k + 4^k + 3^k + 2^k.
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n.A057250
Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n.
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n.A057251
Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n.
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n.A057252
Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n.
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n.A057253
Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n.
- Numbers n such that n | 8^n + 7^n + 6^n + 5^n + 4^n.A057254
Numbers n such that n | 8^n + 7^n + 6^n + 5^n + 4^n.
- Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n.A057255
Numbers n such that n | 7^n + 6^n + 5^n + 4^n + 3^n.
- Numbers k such that k | 6^k + 5^k + 4^k + 3^k + 2^k.A057256
Numbers k such that k | 6^k + 5^k + 4^k + 3^k + 2^k.
- Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n.A057257
Numbers n such that n | 12^n + 11^n + 10^n + 9^n + 8^n + 7^n.
- Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.A057258
Numbers n such that n | 11^n + 10^n + 9^n + 8^n + 7^n + 6^n.
- Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n.A057259
Numbers n such that n | 10^n + 9^n + 8^n + 7^n + 6^n + 5^n.
- Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.A057260
Numbers n such that n | 9^n + 8^n + 7^n + 6^n + 5^n + 4^n.