Sequences
392,541 sequences
- Number of possible sets {sum(T) : T contained in S}, where S is a multiset of elements of Z/nZ.A058961
Number of possible sets {sum(T) : T contained in S}, where S is a multiset of elements of Z/nZ.
- a(n) = 2^(2*n)*(2*n+1).A058962
a(n) = 2^(2*n)*(2*n+1).
- Modular form of Level 4 and weight 5/2.A058963
Modular form of Level 4 and weight 5/2.
- Decimal expansion of series-parallel constant.A058964
Decimal expansion of series-parallel constant.
- Continued fraction expansion of series-parallel constant.A058965
Continued fraction expansion of series-parallel constant.
- a(3) = 1, otherwise a(n) = n*2^(n-3) - 2^(n-2) - 2.A058966
a(3) = 1, otherwise a(n) = n*2^(n-3) - 2^(n-2) - 2.
- If n < 8 then A058966(n), else n*2^(n - 3) - 2*n - 50.A058967
If n < 8 then A058966(n), else n*2^(n - 3) - 2*n - 50.
- a(n) = 2^n + 2^(n - 1) - n - 8.A058968
a(n) = 2^n + 2^(n - 1) - n - 8.
- Numerators of expansion of a function eta(x) related to Cremer points.A058969
Numerators of expansion of a function eta(x) related to Cremer points.
- Denominators of expansion of a function eta(x) related to Cremer points.A058970
Denominators of expansion of a function eta(x) related to Cremer points.
- For a rational number p/q let f(p/q) = sum of divisors of p+q divided by number of divisors of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.A058971
For a rational number p/q let f(p/q) = sum of divisors of p+q divided by number of divisors of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.
- For a rational number p/q let f(p/q) = sum of aliquot divisors of p+q divided by number of divisors of p+q; sequence gives numbers k such that, starting at k/1 and iterating f, an integer is eventually reached.A058972
For a rational number p/q let f(p/q) = sum of aliquot divisors of p+q divided by number of divisors of p+q; sequence gives numbers k such that, starting at k/1 and iterating f, an integer is eventually reached.
- First integer reached in A058972.A058973
First integer reached in A058972.
- a(n) = 0 if n = 1 or a prime, otherwise a(n) = s + a(s) iterated until no change occurs, where s (A008472) is sum of distinct primes dividing n.A058974
a(n) = 0 if n = 1 or a prime, otherwise a(n) = s + a(s) iterated until no change occurs, where s (A008472) is sum of distinct primes dividing n.
- Total number of flats in the lattice of contractions of the n-cube. Also number of partitions of vertex set of n-cube into blocks all of which induce connected subgraphs.A058975
Total number of flats in the lattice of contractions of the n-cube. Also number of partitions of vertex set of n-cube into blocks all of which induce connected subgraphs.
- Number of inequivalent n-variable 3-valued Post functions under action of complementing group D(n,3).A058976
Number of inequivalent n-variable 3-valued Post functions under action of complementing group D(n,3).
- For a rational number p/q let f(p/q) = sum of distinct prime factors (A008472) of p+q divided by number of distinct prime factors (A001221) of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.A058977
For a rational number p/q let f(p/q) = sum of distinct prime factors (A008472) of p+q divided by number of distinct prime factors (A001221) of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.
- Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.A058978
Minimal number of (non-consecutive) Fibonacci numbers needed to get n by addition and subtraction.
- Number of numbers m such that phi(m) = 4n.A058979
Number of numbers m such that phi(m) = 4n.
- Positive numbers of form 4*k such that card(invphi(4*k)) = 0 (the nontotients congruent to 0 modulo 4).A058980
Positive numbers of form 4*k such that card(invphi(4*k)) = 0 (the nontotients congruent to 0 modulo 4).
- Improperly Reduced Fibonacci Sequence: begin with a(0) = 0, a(1) = 1 and a(n) = [ a(n-1) + a(n-2) ] / a(k). a(k) is the first (not necessarily the greatest) term including 1 which divides a(n-1) + a(n-2) not previously used.A058981
Improperly Reduced Fibonacci Sequence: begin with a(0) = 0, a(1) = 1 and a(n) = [ a(n-1) + a(n-2) ] / a(k). a(k) is the first (not necessarily the greatest) term including 1 which divides a(n-1) + a(n-2) not previously used.
- Increasing values of the Improperly Reduced Fibonacci Sequence (A058981).A058982
Increasing values of the Improperly Reduced Fibonacci Sequence (A058981).
- Position at which increasing values of the Improperly Reduced Fibonacci Sequence (A058981) occur.A058983
Position at which increasing values of the Improperly Reduced Fibonacci Sequence (A058981) occur.
- Number of partitions of n in which number of parts is not 2.A058984
Number of partitions of n in which number of parts is not 2.
- a(n) = 6 + 33*n + 6*binomial(n, 2) - 28*binomial(n, 3) + 20*binomial(n, 4) - 47*binomial(n, 5).A058985
a(n) = 6 + 33*n + 6*binomial(n, 2) - 28*binomial(n, 3) + 20*binomial(n, 4) - 47*binomial(n, 5).
- Sorting by prefix reversal (or "flipping pancakes"). You can only reverse segments that include the initial term of the current permutation; a(n) is the number of reversals that are needed to transform an arbitrary permutation of n letters to the identity permutation.A058986
Sorting by prefix reversal (or "flipping pancakes"). You can only reverse segments that include the initial term of the current permutation; a(n) is the number of reversals that are needed to transform an arbitrary permutation of n letters to the identity permutation.
- a(n) = Catalan(n) - Motzkin(n-1).A058987
a(n) = Catalan(n) - Motzkin(n-1).
- For a rational number p/q let f(p/q) = p*q divided by number of divisors of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.A058988
For a rational number p/q let f(p/q) = p*q divided by number of divisors of p+q; a(n) is obtained by iterating f, starting at n/1, until an integer is reached, or if no integer is ever reached then a(n) = 0.
- Largest number of consecutive integers such that each is divisible by a prime <= the n-th prime.A058989
Largest number of consecutive integers such that each is divisible by a prime <= the n-th prime.
- Smallest power of two whose reversal of its n-th power is a prime.A058990
Smallest power of two whose reversal of its n-th power is a prime.
- Smallest number not a power of two whose reversal of its n-th power is a prime.A058991
Smallest number not a power of two whose reversal of its n-th power is a prime.
- Gossip Problem: there are n people and each of them knows some item of gossip not known to the others. They communicate by telephone and whenever one person calls another, they tell each other all that they know at that time. How many calls are required before each gossip knows everything?A058992
Gossip Problem: there are n people and each of them knows some item of gossip not known to the others. They communicate by telephone and whenever one person calls another, they tell each other all that they know at that time. How many calls are required before each gossip knows everything?
- Numbers m such that 5^m reversed is a prime.A058993
Numbers m such that 5^m reversed is a prime.
- Numbers m such that 7^m reversed is prime.A058994
Numbers m such that 7^m reversed is prime.
- Numbers m such that 13^m reversed is prime.A058995
Numbers m such that 13^m reversed is prime.
- Primes whose reversal is a fourth power.A058996
Primes whose reversal is a fourth power.
- Least power k greater than 1 for which n^k reversed is a prime, or 0 if impossible.A058997
Least power k greater than 1 for which n^k reversed is a prime, or 0 if impossible.
- Least exponent k for which n^k reversed (leading zeros are not allowed) is a prime, or 0 if impossible.A058998
Least exponent k for which n^k reversed (leading zeros are not allowed) is a prime, or 0 if impossible.
- Primes p such that x^17 = 2 has no solution mod p.A058999
Primes p such that x^17 = 2 has no solution mod p.
- Primes whose reversal is a fifth power.A059000
Primes whose reversal is a fifth power.
- Primes whose reversal is a sixth power.A059001
Primes whose reversal is a sixth power.
- Primes whose reversal is a seventh power.A059002
Primes whose reversal is a seventh power.
- Primes whose reversal is an eighth power.A059003
Primes whose reversal is an eighth power.
- Smallest prime whose reversal is an n-th power.A059004
Smallest prime whose reversal is an n-th power.
- Primes whose reversal is a tenth power.A059005
Primes whose reversal is a tenth power.
- Numbers k such that x^k + x^2 + 1 is irreducible over GF(7).A059006
Numbers k such that x^k + x^2 + 1 is irreducible over GF(7).
- Numbers m such that m^2 reversed is a prime.A059007
Numbers m such that m^2 reversed is a prime.
- Numbers n such that n^3 reversed is a prime.A059008
Numbers n such that n^3 reversed is a prime.
- Numbers having an odd number of zeros in their binary expansion.A059009
Numbers having an odd number of zeros in their binary expansion.
- Natural numbers having an even number of nonleading zeros in their binary expansion.A059010
Natural numbers having an even number of nonleading zeros in their binary expansion.