Sequences
392,541 sequences
- Let p = n-th prime; sequence gives ((p-2)!-1)/p.A066161
Let p = n-th prime; sequence gives ((p-2)!-1)/p.
- Let p be a prime of the form 4k-1; sequence gives (q!^2-1)/p where q = (p-1)/2.A066162
Let p be a prime of the form 4k-1; sequence gives (q!^2-1)/p where q = (p-1)/2.
- Let p be a prime of the form 4k+1; sequence gives (q!^2 + 4)/p where q = (p-3)/2.A066163
Let p be a prime of the form 4k+1; sequence gives (q!^2 + 4)/p where q = (p-3)/2.
- Sum of interior angles in an n-sided polygon in degrees.A066164
Sum of interior angles in an n-sided polygon in degrees.
- Variant of Stanley's children's game. Class of n (named) children forms into rings of at least two with exactly one child inside each ring. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.A066165
Variant of Stanley's children's game. Class of n (named) children forms into rings of at least two with exactly one child inside each ring. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.
- Stanley's children's game. Class of n (named) children forms into rings with exactly one child inside each ring. We allow the case when outer ring has only one child. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.A066166
Stanley's children's game. Class of n (named) children forms into rings with exactly one child inside each ring. We allow the case when outer ring has only one child. a(n) gives number of possibilities, including clockwise order (or which hand is held), in each ring.
- Numbers n such that phi(n) = (phi(n+1) + phi(n-1))/2.A066167
Numbers n such that phi(n) = (phi(n+1) + phi(n-1))/2.
- a(n) = least k such that phi(k) > sigma(n).A066168
a(n) = least k such that phi(k) > sigma(n).
- Least k such that phi(k) >= n.A066169
Least k such that phi(k) >= n.
- Triangle read by rows: T(n,k) = (-1)^n*(-1)^(floor(3*k/2))*binomial(floor((n+k)/2),k), 0 <= k <= n, n >= 0.A066170
Triangle read by rows: T(n,k) = (-1)^n*(-1)^(floor(3*k/2))*binomial(floor((n+k)/2),k), 0 <= k <= n, n >= 0.
- Numbers n such that d(n) = phi(n+1) - phi(n), where d(n) denotes the number of divisors of n.A066171
Numbers n such that d(n) = phi(n+1) - phi(n), where d(n) denotes the number of divisors of n.
- Numbers k such that phi(k+1) - phi(k) = -d(k).A066172
Numbers k such that phi(k+1) - phi(k) = -d(k).
- Self-reciprocating sequence: the integer part of powers of the reciprocal sum.A066173
Self-reciprocating sequence: the integer part of powers of the reciprocal sum.
- First member of a prime sextet: p, (p-1)/2, (p-3)/4, (p-7)/8, (p-15)/16, (p-31)/32.A066174
First member of a prime sextet: p, (p-1)/2, (p-3)/4, (p-7)/8, (p-15)/16, (p-31)/32.
- Numbers k such that sigma(phi(sigma(k))) = k.A066175
Numbers k such that sigma(phi(sigma(k))) = k.
- Numbers k such that sigma(k+1) - sigma(k) = sigma(k)/d(k), where d(k) denotes the number of divisors of k.A066176
Numbers k such that sigma(k+1) - sigma(k) = sigma(k)/d(k), where d(k) denotes the number of divisors of k.
- Numbers n such that sigma(n+1)-sigma(n) = -sigma(n)/d(n), where d(n) denotes the number of divisors of n.A066177
Numbers n such that sigma(n+1)-sigma(n) = -sigma(n)/d(n), where d(n) denotes the number of divisors of n.
- Number of binary bit strings of length n with no block of 8 or more 0's. Nonzero heptanacci numbers, A122189.A066178
Number of binary bit strings of length n with no block of 8 or more 0's. Nonzero heptanacci numbers, A122189.
- Primes p such that (p-1)/2 and (p-3)/4 are also prime.A066179
Primes p such that (p-1)/2 and (p-3)/4 are also prime.
- a(n) = smallest base b so that repunit (b^prime(n) - 1) / (b - 1) is prime, where prime(n) = n-th prime; or 0 if no such base exists.A066180
a(n) = smallest base b so that repunit (b^prime(n) - 1) / (b - 1) is prime, where prime(n) = n-th prime; or 0 if no such base exists.
- Permutation of the integers with cycle form {1}, {2, 3}, {4, 5, 6}, {7, 8, 9, 10}, ...A066181
Permutation of the integers with cycle form {1}, {2, 3}, {4, 5, 6}, {7, 8, 9, 10}, ...
- Permutation of the integers with cycle form {1}, {3, 2}, {6, 5, 4}, {10, 9, 8, 7}, ...A066182
Permutation of the integers with cycle form {1}, {3, 2}, {6, 5, 4}, {10, 9, 8, 7}, ...
- Total sum of squares of parts in all partitions of n.A066183
Total sum of squares of parts in all partitions of n.
- Sum of the first moments of all partitions of n with weight starting at 1.A066184
Sum of the first moments of all partitions of n with weight starting at 1.
- Sum of the first moments of all partitions of n with weights starting at 0.A066185
Sum of the first moments of all partitions of n with weights starting at 0.
- Sum of all parts of all partitions of n.A066186
Sum of all parts of all partitions of n.
- Sum of the second moments of all partitions of n with weights starting from 1.A066187
Sum of the second moments of all partitions of n with weights starting from 1.
- Sum of the second moments of all partitions of n with weights starting from 0.A066188
Sum of the second moments of all partitions of n with weights starting from 0.
- Sum of all partitions of n into distinct parts.A066189
Sum of all partitions of n into distinct parts.
- Numbers k such that the sum of the even aliquot parts of k divides k.A066190
Numbers k such that the sum of the even aliquot parts of k divides k.
- Numbers k such that the sum of the odd aliquot parts of k divides k.A066191
Numbers k such that the sum of the odd aliquot parts of k divides k.
- Composite numbers k such that the sum of the odd aliquot parts of k divides k.A066192
Composite numbers k such that the sum of the odd aliquot parts of k divides k.
- Composite numbers k such that the difference between the odd and even aliquot parts of k divides k.A066193
Composite numbers k such that the difference between the odd and even aliquot parts of k divides k.
- A permutation of the integers (a fractal sequence): a(n) = A006068(n-1) + 1.A066194
A permutation of the integers (a fractal sequence): a(n) = A006068(n-1) + 1.
- Smallest prime containing n zeros in its binary expansion.A066195
Smallest prime containing n zeros in its binary expansion.
- Primes which have an equal number of zeros and ones in their binary expansion.A066196
Primes which have an equal number of zeros and ones in their binary expansion.
- Squarefree kernel of (n*prime(n))*(n+prime(n)).A066197
Squarefree kernel of (n*prime(n))*(n+prime(n)).
- Numbers n where phi changes as fast as sigma, i.e., abs(phi(n+1) - phi(n)) = abs(sigma(n+1) - sigma(n)).A066198
Numbers n where phi changes as fast as sigma, i.e., abs(phi(n+1) - phi(n)) = abs(sigma(n+1) - sigma(n)).
- a(1) = 1; for n > 1, a(n) = a(n-1)-(n+1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n+1).A066199
a(1) = 1; for n > 1, a(n) = a(n-1)-(n+1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n+1).
- a(1) = 1; for n > 1, a(n) = a(n-1)-(n+2) if this is positive and has not already appeared, otherwise a(n) = a(n-1)+(n+2).A066200
a(1) = 1; for n > 1, a(n) = a(n-1)-(n+2) if this is positive and has not already appeared, otherwise a(n) = a(n-1)+(n+2).
- Array read by antidiagonals upwards: for n-th row (n>=0), T(n,0) = 1; for k > 0, T(n,k) = T(n,k-1)-(n+k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(n+k-1).A066201
Array read by antidiagonals upwards: for n-th row (n>=0), T(n,0) = 1; for k > 0, T(n,k) = T(n,k-1)-(n+k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(n+k-1).
- Array T(n,k) (n>=1, k>=1) read by antidiagonals: T(n,n) = 1 for all n; fill in array above diagonal by symmetry; for row n, starting at diagonal T(n,n)=1, for k > n, T(n,k) = T(n,k-1)-(k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(k-1).A066202
Array T(n,k) (n>=1, k>=1) read by antidiagonals: T(n,n) = 1 for all n; fill in array above diagonal by symmetry; for row n, starting at diagonal T(n,n)=1, for k > n, T(n,k) = T(n,k-1)-(k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(k-1).
- a(1) = 2; a(2) = 1; for n > 2, a(n) = a(n-1)-(n-1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n-1).A066203
a(1) = 2; a(2) = 1; for n > 2, a(n) = a(n-1)-(n-1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n-1).
- a(1) = 4; a(2) = 3; a(3) = 1; for n > 3, a(n) = a(n-1)-(n-1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n-1).A066204
a(1) = 4; a(2) = 3; a(3) = 1; for n > 3, a(n) = a(n-1)-(n-1) if this is positive and has not already appeared in the sequence, otherwise a(n) = a(n-1)+(n-1).
- a(n) = Product_{k=1..n} prime(2k-1), where prime(k) is k-th prime.A066205
a(n) = Product_{k=1..n} prime(2k-1), where prime(k) is k-th prime.
- a(n) = Product_{k=1..n} prime(2k), where prime(k) is the k-th prime.A066206
a(n) = Product_{k=1..n} prime(2k), where prime(k) is the k-th prime.
- All primes that divide n are of the form prime(2k), where prime(k) is k-th prime.A066207
All primes that divide n are of the form prime(2k), where prime(k) is k-th prime.
- All primes that divide n are of the form prime(2k-1), where prime(k) is k-th prime.A066208
All primes that divide n are of the form prime(2k-1), where prime(k) is k-th prime.
- A053041(n)-10^(n-1).A066209
A053041(n)-10^(n-1).
- a(n) = ((2*n)^(2*n+2) - 1)/(4*n^2 - 1).A066210
a(n) = ((2*n)^(2*n+2) - 1)/(4*n^2 - 1).