Sequences
392,541 sequences
- Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=3.A050211
Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=3.
- Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=4.A050212
Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=4.
- Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=5.A050213
Triangle of number of permutations of {1, 2, ..., n} having exactly k cycles, each of which is of length >=r for r=5.
- a(n) = Product_{d|n, d^2<=n} (d+n/d); a(1)=1.A050214
a(n) = Product_{d|n, d^2<=n} (d+n/d); a(1)=1.
- Starting positions of strings of 2 2's in the decimal expansion of Pi.A050215
Starting positions of strings of 2 2's in the decimal expansion of Pi.
- Number of primes between (prime(n))^2 and (prime(n+1))^2, with a(0) = 2 by convention.A050216
Number of primes between (prime(n))^2 and (prime(n+1))^2, with a(0) = 2 by convention.
- Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.A050217
Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.
- Sums of digits of Smith numbers A006753.A050218
Sums of digits of Smith numbers A006753.
- Smaller of Smith brothers.A050219
Smaller of Smith brothers.
- Larger of Smith brothers.A050220
Larger of Smith brothers.
- a(n) = number of sets of consecutive primes whose arithmetic mean is A060863(n).A050221
a(n) = number of sets of consecutive primes whose arithmetic mean is A060863(n).
- Starting positions of strings of 2 3's in the decimal expansion of Pi.A050222
Starting positions of strings of 2 3's in the decimal expansion of Pi.
- Digit sums of hoax numbers A019506.A050223
Digit sums of hoax numbers A019506.
- 1/2-Smith numbers.A050224
1/2-Smith numbers.
- 1/3-Smith numbers.A050225
1/3-Smith numbers.
- Numbers m such that m divides Sum_{k = 1..m} A000005(k).A050226
Numbers m such that m divides Sum_{k = 1..m} A000005(k).
- Triangle of number of n-tosses having a run of r or more heads for a fair coin with r=1 to n across and n=1, 2, ... down.A050227
Triangle of number of n-tosses having a run of r or more heads for a fair coin with r=1 to n across and n=1, 2, ... down.
- a(n) is the number of subsequences {s(k)} of {1,2,3,...n} such that s(k+1)-s(k) is 1 or 3.A050228
a(n) is the number of subsequences {s(k)} of {1,2,3,...n} such that s(k+1)-s(k) is 1 or 3.
- Numbers k such that for any x in 1..k-1 there exists a y in 0..k-2 such that x^2 == 2^y (mod k).A050229
Numbers k such that for any x in 1..k-1 there exists a y in 0..k-2 such that x^2 == 2^y (mod k).
- Starting positions of strings of 2 4's in the decimal expansion of Pi.A050230
Starting positions of strings of 2 4's in the decimal expansion of Pi.
- a(n) is the number of n-tosses having a run of 3 or more heads for a fair coin (i.e., probability is a(n)/2^n).A050231
a(n) is the number of n-tosses having a run of 3 or more heads for a fair coin (i.e., probability is a(n)/2^n).
- a(n) is the number of n-tosses having a run of 4 or more heads for a fair coin (i.e., probability is a(n)/2^n).A050232
a(n) is the number of n-tosses having a run of 4 or more heads for a fair coin (i.e., probability is a(n)/2^n).
- a(n) is the number of n-tosses having a run of 5 or more heads for a fair coin (i.e., probability is a(n)/2^n).A050233
a(n) is the number of n-tosses having a run of 5 or more heads for a fair coin (i.e., probability is a(n)/2^n).
- Primes in A007923.A050234
Primes in A007923.
- a(n) is the number of n-digit Keith numbers A007629.A050235
a(n) is the number of n-digit Keith numbers A007629.
- Indices of consecutive squares palindromic primes; x such that x^2 + (x+1)^2 is palindromic and prime.A050236
Indices of consecutive squares palindromic primes; x such that x^2 + (x+1)^2 is palindromic and prime.
- a(n) = the smallest number m such that there are exactly n sets of consecutive primes, each of which has an arithmetic mean of m.A050237
a(n) = the smallest number m such that there are exactly n sets of consecutive primes, each of which has an arithmetic mean of m.
- Starting positions of strings of 2 5's in the decimal expansion of Pi.A050238
Starting positions of strings of 2 5's in the decimal expansion of Pi.
- Consecutive square palindromic primes; palindromic primes of the form x^2 + (x+1)^2, where x values are given by A050236.A050239
Consecutive square palindromic primes; palindromic primes of the form x^2 + (x+1)^2, where x values are given by A050236.
- Handsome numbers (A007532) representable as a sum of any positive powers of their digits in two distinct ways, not counting different powers of duplicated digits as distinct.A050240
Handsome numbers (A007532) representable as a sum of any positive powers of their digits in two distinct ways, not counting different powers of duplicated digits as distinct.
- Handsome numbers (A007532) representable in exactly two distinct ways (counting different powers of duplicated digits as distinct).A050241
Handsome numbers (A007532) representable in exactly two distinct ways (counting different powers of duplicated digits as distinct).
- [ (phi + sqrt(phi))^n ], phi = (1+sqrt(5))/2.A050242
[ (phi + sqrt(phi))^n ], phi = (1+sqrt(5))/2.
- a(n) = floor((1/2 * (sqrt(2) + 1 + sqrt(2*sqrt(2) - 1)))^n ).A050243
a(n) = floor((1/2 * (sqrt(2) + 1 + sqrt(2*sqrt(2) - 1)))^n ).
- Numbers k such that 2^k + 3^k is a semiprime.A050244
Numbers k such that 2^k + 3^k is a semiprime.
- Starting positions of strings of 2 6's in the decimal expansion of Pi.A050245
Starting positions of strings of 2 6's in the decimal expansion of Pi.
- Digital clock primes.A050246
Digital clock primes.
- a(n) is the sum of the first A045345(n) primes.A050247
a(n) is the sum of the first A045345(n) primes.
- Integer averages of first k primes for some k.A050248
Integer averages of first k primes for some k.
- Weakly prime numbers (changing any one decimal digit always produces a composite number). Also called digitally delicate primes.A050249
Weakly prime numbers (changing any one decimal digit always produces a composite number). Also called digitally delicate primes.
- Number of nonzero palindromes less than 10^n.A050250
Number of nonzero palindromes less than 10^n.
- Number of palindromic primes less than 10^n.A050251
Number of palindromic primes less than 10^n.
- Number of digits in the prime factorization of n (counting terms of the form p^1 as p).A050252
Number of digits in the prime factorization of n (counting terms of the form p^1 as p).
- G.f.: ( 1 - x^2 - sqrt( 1 - 2*x^2 - 4*x^3 - 3*x^4 ) ) / ( 2*x^3 ).A050253
G.f.: ( 1 - x^2 - sqrt( 1 - 2*x^2 - 4*x^3 - 3*x^4 ) ) / ( 2*x^3 ).
- Starting positions of strings of 2 7's in the decimal expansion of Pi.A050254
Starting positions of strings of 2 7's in the decimal expansion of Pi.
- A Diaconis-Mosteller approximation to the Birthday problem function.A050255
A Diaconis-Mosteller approximation to the Birthday problem function.
- a(n) = floor(47*(n-3/2)^(3/2)).A050256
a(n) = floor(47*(n-3/2)^(3/2)).
- Number of distinct antimagic squares of order n (modulo rotations and reflections).A050257
Number of distinct antimagic squares of order n (modulo rotations and reflections).
- Number of "prime quadruplets" with largest member < 10^n.A050258
Number of "prime quadruplets" with largest member < 10^n.
- Numbers k such that 2^k == 3 (mod k).A050259
Numbers k such that 2^k == 3 (mod k).
- Quiteprimes: numbers k such that |2*(k mod p) - p| <= p + 1 - sqrt(p) for all primes p <= sqrt(k).A050260
Quiteprimes: numbers k such that |2*(k mod p) - p| <= p + 1 - sqrt(p) for all primes p <= sqrt(k).