Sequences
392,541 sequences
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 5.A068011
Number of subsets of {1,2,3,...,n} that sum to 0 mod 5.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 6.A068012
Number of subsets of {1,2,3,...,n} that sum to 0 mod 6.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 7.A068013
Number of subsets of {1,2,3,...,n} that sum to 0 mod 7.
- Nonprimes n such that 1+phi(n) and -1 + sigma(n) are prime numbers.A068014
Nonprimes n such that 1+phi(n) and -1 + sigma(n) are prime numbers.
- Gaps between non-twin primes.A068015
Gaps between non-twin primes.
- Lonely non-twin primes: non-twins sandwiched between two pairs of twins.A068016
Lonely non-twin primes: non-twins sandwiched between two pairs of twins.
- Composite n such that sigma(n) - 1 and sigma(n) + 1 are twin primes.A068017
Composite n such that sigma(n) - 1 and sigma(n) + 1 are twin primes.
- Number of fixed points in all 132- and 213-avoiding permutations of {1,2,...,n} (these are permutations with runs consisting of consecutive integers).A068018
Number of fixed points in all 132- and 213-avoiding permutations of {1,2,...,n} (these are permutations with runs consisting of consecutive integers).
- Composite n such that both 1 + phi(n) and -1 + phi(n) are primes, i.e., phi(n) is the middle term between twin primes (A014574).A068019
Composite n such that both 1 + phi(n) and -1 + phi(n) are primes, i.e., phi(n) is the middle term between twin primes (A014574).
- a(n) = Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=3.A068020
a(n) = Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=3.
- Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=4.A068021
Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=4.
- Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=5.A068022
Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=5.
- Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=6.A068023
Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=6.
- Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=7.A068024
Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=7.
- Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=8.A068025
Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=8.
- Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=9.A068026
Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=9.
- Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=10.A068027
Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=10.
- Decimal expansion of 22/7.A068028
Decimal expansion of 22/7.
- Table of sorted score sequences (including duplications), with A000571 giving the number of score sequences of length n.A068029
Table of sorted score sequences (including duplications), with A000571 giving the number of score sequences of length n.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 9.A068030
Number of subsets of {1,2,3,...,n} that sum to 0 mod 9.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 10.A068031
Number of subsets of {1,2,3,...,n} that sum to 0 mod 10.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 11.A068032
Number of subsets of {1,2,3,...,n} that sum to 0 mod 11.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 12.A068033
Number of subsets of {1,2,3,...,n} that sum to 0 mod 12.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 13.A068034
Number of subsets of {1,2,3,...,n} that sum to 0 mod 13.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 14.A068035
Number of subsets of {1,2,3,...,n} that sum to 0 mod 14.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 15.A068036
Number of subsets of {1,2,3,...,n} that sum to 0 mod 15.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 16.A068037
Number of subsets of {1,2,3,...,n} that sum to 0 mod 16.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 17.A068038
Number of subsets of {1,2,3,...,n} that sum to 0 mod 17.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 18.A068039
Number of subsets of {1,2,3,...,n} that sum to 0 mod 18.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 19.A068040
Number of subsets of {1,2,3,...,n} that sum to 0 mod 19.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 20.A068041
Number of subsets of {1,2,3,...,n} that sum to 0 mod 20.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 21.A068042
Number of subsets of {1,2,3,...,n} that sum to 0 mod 21.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 25.A068043
Number of subsets of {1,2,3,...,n} that sum to 0 mod 25.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 32.A068044
Number of subsets of {1,2,3,...,n} that sum to 0 mod 32.
- Number of subsets of {1,2,3,...,n} that sum to 0 mod 64.A068045
Number of subsets of {1,2,3,...,n} that sum to 0 mod 64.
- Palindromes of length greater than 1 in decimal expansion of Pi (not showing leading 0's).A068046
Palindromes of length greater than 1 in decimal expansion of Pi (not showing leading 0's).
- Starting position of the n-th nontrivial palindrome in decimal expansion of Pi.A068047
Starting position of the n-th nontrivial palindrome in decimal expansion of Pi.
- Length of the n-th nontrivial palindrome in decimal expansion of Pi.A068048
Length of the n-th nontrivial palindrome in decimal expansion of Pi.
- The first term greater than one on each row of A068009. a(n) = A068009[n, A002024[n]].A068049
The first term greater than one on each row of A068009. a(n) = A068009[n, A002024[n]].
- Number of values of k, 1<=k<=n, for which floor(n/k) is prime.A068050
Number of values of k, 1<=k<=n, for which floor(n/k) is prime.
- Number of n-node connected graphs with one cycle, possibly of length 1 or 2.A068051
Number of n-node connected graphs with one cycle, possibly of length 1 or 2.
- Start from 1, shift one left and sum mod 2 (bitwise-XOR) to get 3 (11 in binary), then shift two steps left and XOR to get 15 (1111 in binary), then three steps and XOR to get 119 (1110111 in binary), then four steps and so on.A068052
Start from 1, shift one left and sum mod 2 (bitwise-XOR) to get 3 (11 in binary), then shift two steps left and XOR to get 15 (1111 in binary), then three steps and XOR to get 119 (1110111 in binary), then four steps and so on.
- Start with one 1 in the infinite vector of zeros, shift one right or left and sum mod 2 (bitwise-XOR) to get 11, then shift two steps and XOR to get 1111, then three steps and XOR to get 1110111, then four steps and so on.A068053
Start with one 1 in the infinite vector of zeros, shift one right or left and sum mod 2 (bitwise-XOR) to get 11, then shift two steps and XOR to get 1111, then three steps and XOR to get 1110111, then four steps and so on.
- First differences of A066425.A068054
First differences of A066425.
- Partial sums of A066425.A068055
Partial sums of A066425.
- Sums of all subsets of A066425.A068056
Sums of all subsets of A066425.
- First differences of A068056.A068057
First differences of A068056.
- Zero-based position of the least significant (rightmost) zero bit in the bit-masks A068222 (A068224).A068058
Zero-based position of the least significant (rightmost) zero bit in the bit-masks A068222 (A068224).
- Partial sums of A068058 + 1.A068059
Partial sums of A068058 + 1.
- Number of subsets of {1, 2, ..., n} that do not contain a subset of the form {x, 2x, 3x}.A068060
Number of subsets of {1, 2, ..., n} that do not contain a subset of the form {x, 2x, 3x}.