Sequences
392,541 sequences
- Partial sums of A014825, second partial sums of A002450.A052161
Partial sums of A014825, second partial sums of A002450.
- Primes at which difference pattern X4Y (X and Y >= 6) occurs in A001223.A052162
Primes at which difference pattern X4Y (X and Y >= 6) occurs in A001223.
- Primes at which the difference pattern X24Y (X and Y >= 6) occurs in A001223.A052163
Primes at which the difference pattern X24Y (X and Y >= 6) occurs in A001223.
- Primes at which the difference pattern X42Y (X and Y >= 6) occurs in A001223.A052164
Primes at which the difference pattern X42Y (X and Y >= 6) occurs in A001223.
- Primes at which the difference pattern X,2,4,2,Y (X and Y >= 6) occurs in A001223.A052165
Primes at which the difference pattern X,2,4,2,Y (X and Y >= 6) occurs in A001223.
- Primes at which the difference pattern X424Y (X and Y >= 6) occurs in A001223.A052166
Primes at which the difference pattern X424Y (X and Y >= 6) occurs in A001223.
- Primes at which difference pattern X2424Y (X and Y >= 6) occurs in A001223.A052167
Primes at which difference pattern X2424Y (X and Y >= 6) occurs in A001223.
- Primes at which difference pattern X4242Y (X and Y >= 6) occurs in A001223.A052168
Primes at which difference pattern X4242Y (X and Y >= 6) occurs in A001223.
- Equivalent of the Kurepa hypothesis for left factorial.A052169
Equivalent of the Kurepa hypothesis for left factorial.
- Number of directed loopless multigraphs with n arcs.A052170
Number of directed loopless multigraphs with n arcs.
- Number of directed multigraphs with loops on an infinite set of nodes containing a total of n arcs.A052171
Number of directed multigraphs with loops on an infinite set of nodes containing a total of n arcs.
- Pure 3-multicomplexes on infinite set of nodes with n 3-simplexes.A052172
Pure 3-multicomplexes on infinite set of nodes with n 3-simplexes.
- Another version of the Catalan triangle A008315.A052173
Another version of the Catalan triangle A008315.
- Triangle of numbers arising in enumeration of walks on square lattice.A052174
Triangle of numbers arising in enumeration of walks on square lattice.
- Triangle of numbers arising in enumeration of walks on square lattice.A052175
Triangle of numbers arising in enumeration of walks on square lattice.
- Triangle of numbers arising in enumeration of walks on square lattice.A052176
Triangle of numbers arising in enumeration of walks on square lattice.
- Number of walks on simple cubic lattice (starting on the xy plane, never going below it and finishing a height 1 above it).A052177
Number of walks on simple cubic lattice (starting on the xy plane, never going below it and finishing a height 1 above it).
- Number of walks of length n on the simple cubic lattice terminating at height 2 above the (x,y)-plane.A052178
Number of walks of length n on the simple cubic lattice terminating at height 2 above the (x,y)-plane.
- Triangle of numbers arising in enumeration of walks on cubic lattice.A052179
Triangle of numbers arising in enumeration of walks on cubic lattice.
- Last filtering prime for n-th prime p: find smallest prime factor of each of the composite numbers between p and next prime; take maximal value.A052180
Last filtering prime for n-th prime p: find smallest prime factor of each of the composite numbers between p and next prime; take maximal value.
- Partial sums of A050483.A052181
Partial sums of A050483.
- Determinant of n X n matrix whose rows are cyclic permutations of 1..n.A052182
Determinant of n X n matrix whose rows are cyclic permutations of 1..n.
- a(n) = (n + 2) * binomial(3*n, n) / (2*n + 1).A052183
a(n) = (n + 2) * binomial(3*n, n) / (2*n + 1).
- Length of shortest dominating cycle in binary hypercube of dimension n.A052184
Length of shortest dominating cycle in binary hypercube of dimension n.
- Length of shortest dominating path in binary hypercube of dimension n.A052185
Length of shortest dominating path in binary hypercube of dimension n.
- Number of permutations of [n] with no strong fixed points.A052186
Number of permutations of [n] with no strong fixed points.
- a(n) is the smallest prime p such that p, p+d, and p+2d are consecutive primes where d = 2 for n = 1 and d = 6*(n-1) for n > 1.A052187
a(n) is the smallest prime p such that p, p+d, and p+2d are consecutive primes where d = 2 for n = 1 and d = 6*(n-1) for n > 1.
- Primes p such that p, p+12, p+24 are consecutive primes.A052188
Primes p such that p, p+12, p+24 are consecutive primes.
- Primes p such that p, p+18, p+36 are consecutive primes.A052189
Primes p such that p, p+18, p+36 are consecutive primes.
- Primes p such that p, p+24, p+48 are consecutive primes.A052190
Primes p such that p, p+24, p+48 are consecutive primes.
- Smallest multiple of n with no isolated digits.A052191
Smallest multiple of n with no isolated digits.
- Smallest a(n) for which n*a(n) has no isolated digits.A052192
Smallest a(n) for which n*a(n) has no isolated digits.
- Positive integers sorted by length of name in American English and alphabetical order.A052193
Positive integers sorted by length of name in American English and alphabetical order.
- Positive integers sorted by length of name in English and numerical order.A052194
Positive integers sorted by length of name in English and numerical order.
- Primes p such that p, p+30, p+60 are consecutive primes.A052195
Primes p such that p, p+30, p+60 are consecutive primes.
- Largest natural number less than 10^66 requiring exactly n letters in English.A052196
Largest natural number less than 10^66 requiring exactly n letters in English.
- Primes p such that p, p+36, p+72 are consecutive primes.A052197
Primes p such that p, p+36, p+72 are consecutive primes.
- Primes p such that p, p+42, p+84 are consecutive primes.A052198
Primes p such that p, p+42, p+84 are consecutive primes.
- Numbers that are expressible as the sum of 2 distinct positive squares in more ways than any smaller number.A052199
Numbers that are expressible as the sum of 2 distinct positive squares in more ways than any smaller number.
- Number of n-state, 2-symbol, d+ in {LEFT, RIGHT}, 5-tuple (q, s, q+, s+, d+) (halting or not) Turing machines.A052200
Number of n-state, 2-symbol, d+ in {LEFT, RIGHT}, 5-tuple (q, s, q+, s+, d+) (halting or not) Turing machines.
- Equivalent of the Kurepa hypothesis for left factorial.A052201
Equivalent of the Kurepa hypothesis for left factorial.
- Numbers k such that the product of the logarithms of k's prime factors is greater than their sum.A052202
Numbers k such that the product of the logarithms of k's prime factors is greater than their sum.
- a(n) = (4n+1)*binomial(4n,n)/(3n+1).A052203
a(n) = (4n+1)*binomial(4n,n)/(3n+1).
- a(n) = (5n+1)*C(4n,n)/(3n+1).A052204
a(n) = (5n+1)*C(4n,n)/(3n+1).
- a(n+1) is smallest palindromic prime containing exactly 3 more digits on each end than the previous term, with a(n) as a central substring.A052205
a(n+1) is smallest palindromic prime containing exactly 3 more digits on each end than the previous term, with a(n) as a central substring.
- Partial sums of A050405.A052206
Partial sums of A050405.
- Number of sequences {s(i): i=0..n} such that |s(i)-s(i-1)|=1, i=1..n and s(i)=0 at four values of i, one of which is i=0.A052207
Number of sequences {s(i): i=0..n} such that |s(i)-s(i-1)|=1, i=1..n and s(i)=0 at four values of i, one of which is i=0.
- a(n) = Pell(n)*Pell(2*n)/2.A052208
a(n) = Pell(n)*Pell(2*n)/2.
- b(n)*b(2*n), b(n) = A001353(n+1).A052209
b(n)*b(2*n), b(n) = A001353(n+1).
- Numbers k such that k^3 starts with k itself (in base 10).A052210
Numbers k such that k^3 starts with k itself (in base 10).