Sequences
392,541 sequences
- a(n) is the k-th upper twin prime, where k = n!.A093311
a(n) is the k-th upper twin prime, where k = n!.
- Least k such that (2n + 2k) + 1 and (2n*2k) + 1 are both primes.A093312
Least k such that (2n + 2k) + 1 and (2n*2k) + 1 are both primes.
- Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 2 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.A093313
Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 2 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.
- Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 3 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.A093314
Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 3 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.
- Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 4 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.A093315
Number of permutations s_1,s_2,...,s_n of 1,2,...,n with s_1 = 4 and such that for all j=1,2,...,n, s_j divides Sum_{i=1..j} s_i.
- a(n) = A085653(n) - n.A093316
a(n) = A085653(n) - n.
- Consider numbers n such that mu(n) = mu(n+1), A064148; sequence gives values of mu(A064148(n)).A093317
Consider numbers n such that mu(n) = mu(n+1), A064148; sequence gives values of mu(A064148(n)).
- a(n) = number of positive divisors k of n where mu(k) = 1 and mu(n/k) = -1.A093318
a(n) = number of positive divisors k of n where mu(k) = 1 and mu(n/k) = -1.
- Where A093316 first equals n.A093319
Where A093316 first equals n.
- a(1) = 1; for m >= 2, a(m) = sum{p|m} a(pi(p)), where the sum is over the distinct prime divisors p of m and pi(p) is the order of p among the primes = the number of primes <= p.A093320
a(1) = 1; for m >= 2, a(m) = sum{p|m} a(pi(p)), where the sum is over the distinct prime divisors p of m and pi(p) is the order of p among the primes = the number of primes <= p.
- a(1) = 1; for m >= 2, a(m) =sum_{primes p<m which do not divide m} a(pi(p)), where pi(p) is the order of p among the primes = the number of primes <= p.A093321
a(1) = 1; for m >= 2, a(m) =sum_{primes p<m which do not divide m} a(pi(p)), where pi(p) is the order of p among the primes = the number of primes <= p.
- Tetranacci numbers starting with first four cubes.A093322
Tetranacci numbers starting with first four cubes.
- Triangle read by rows giving number of divisor chains of length n beginning with k (1 <= k <= n).A093323
Triangle read by rows giving number of divisor chains of length n beginning with k (1 <= k <= n).
- a(n) is the smallest natural number m such that n^m + m is prime.A093324
a(n) is the smallest natural number m such that n^m + m is prime.
- Numbers that are divisible by the sum of the factorials of their digits.A093325
Numbers that are divisible by the sum of the factorials of their digits.
- Duplicate of A001359.A093326
Duplicate of A001359.
- Smallest sequence of numbers having in their binary representation alternately more (>) or not-more (<=) binary ones than zeros.A093327
Smallest sequence of numbers having in their binary representation alternately more (>) or not-more (<=) binary ones than zeros.
- a(n) = 2*n^2 + 3.A093328
a(n) = 2*n^2 + 3.
- Isogonal polyhedra with convex faces exist just for these genera.A093329
Isogonal polyhedra with convex faces exist just for these genera.
- Maximal values in A038598.A093330
Maximal values in A038598.
- Number of ternary necklaces of length n with no subsequence 00.A093331
Number of ternary necklaces of length n with no subsequence 00.
- a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(sqrt(2 * (a(n-2)^2 + a(n-1)^2))).A093332
a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(sqrt(2 * (a(n-2)^2 + a(n-1)^2))).
- a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(2 * sqrt(a(n-2) * a(n-1))).A093333
a(0) = 0, a(1) = 1 and for n >= 2, a(n) = floor(2 * sqrt(a(n-2) * a(n-1))).
- Denominators of the coefficients of Euler-Ramanujan's harmonic number expansion into negative powers of a triangular number.A093334
Denominators of the coefficients of Euler-Ramanujan's harmonic number expansion into negative powers of a triangular number.
- a(0) = 1, a(1) = 1 and for n >= 2, a(n) = floor(4 * a(n-2) * a(n-1) / (a(n-2) + a(n-1))).A093335
a(0) = 1, a(1) = 1 and for n >= 2, a(n) = floor(4 * a(n-2) * a(n-1) / (a(n-2) + a(n-1))).
- Second digit of prime(n).A093336
Second digit of prime(n).
- Penultimate digits of the primes.A093337
Penultimate digits of the primes.
- Scan primes, write down initial digit if it is a prime.A093338
Scan primes, write down initial digit if it is a prime.
- Middle digits of primes with an odd number of digits.A093339
Middle digits of primes with an odd number of digits.
- Erroneous version of A094004.A093340
Erroneous version of A094004.
- Decimal expansion of "lemniscate case".A093341
Decimal expansion of "lemniscate case".
- Increasing gaps in A038593 (lower terms).A093342
Increasing gaps in A038593 (lower terms).
- Primes of form (prime(n)^2 + prime(n+1)^2)/2.A093343
Primes of form (prime(n)^2 + prime(n+1)^2)/2.
- a(n) = n! * Sum_{i=1..n} (1/i)*Sum_{j=0..i-1} 1/j!.A093344
a(n) = n! * Sum_{i=1..n} (1/i)*Sum_{j=0..i-1} 1/j!.
- a(n) = n! * {1 + Sum[i=1..n, 1/i*Sum(j=0..i-1, 1/j!)]}.A093345
a(n) = n! * {1 + Sum[i=1..n, 1/i*Sum(j=0..i-1, 1/j!)]}.
- Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.A093346
Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.
- A 3-fractal "castle" starting with 0.A093347
A 3-fractal "castle" starting with 0.
- A 5-fractal "castle" starting with 0.A093348
A 5-fractal "castle" starting with 0.
- A 7-fractal "castle" starting with 0.A093349
A 7-fractal "castle" starting with 0.
- Primes congruent to 6 mod 13.A093350
Primes congruent to 6 mod 13.
- Number of labeled n-vertex graphs with a 2-component.A093351
Number of labeled n-vertex graphs with a 2-component.
- Number of labeled n-vertex graphs without a 2-component.A093352
Number of labeled n-vertex graphs without a 2-component.
- a(n) = (n + (n mod 2))*(n + 1)/2.A093353
a(n) = (n + (n mod 2))*(n + 1)/2.
- Number of prime triples (p,q,r) with p < q < r <= n and q - p = r - q.A093354
Number of prime triples (p,q,r) with p < q < r <= n and q - p = r - q.
- Beginning with 2, primes such that the n-th partial sum is an n-th power.A093355
Beginning with 2, primes such that the n-th partial sum is an n-th power.
- Number of occurrences of pattern 1-2 after n iterations of morphism A007413.A093356
Number of occurrences of pattern 1-2 after n iterations of morphism A007413.
- Number of occurrences of pattern 2-1 after n iterations of morphism A007413.A093357
Number of occurrences of pattern 2-1 after n iterations of morphism A007413.
- Decimal expansion of Sum_{n>=1} 1/prime(n)^n.A093358
Decimal expansion of Sum_{n>=1} 1/prime(n)^n.
- Primes of the form 28n + 1.A093359
Primes of the form 28n + 1.
- a(n) = prime(n)^(n-1).A093360
a(n) = prime(n)^(n-1).