Sequences
392,541 sequences
- Let m = 3, 5, 7, ..., k = 0, 1, 2, 3, ..., z = (m+1)/2, 0 < j <= m. Let n_j be a prime number. Sequence gives T(m,k) = Table[m,k] = number of solutions to Sum_{d=1,2, ..., (z+k)}(n_j)_d = Sum_{d=1,2, ..., (z-k-1)}(n_j)_d = primorial number (A002110).A057611
Let m = 3, 5, 7, ..., k = 0, 1, 2, 3, ..., z = (m+1)/2, 0 < j <= m. Let n_j be a prime number. Sequence gives T(m,k) = Table[m,k] = number of solutions to Sum_{d=1,2, ..., (z+k)}(n_j)_d = Sum_{d=1,2, ..., (z-k-1)}(n_j)_d = primorial number (A002110).
- Numbers that are both Mersenne numbers (A001348) and lucky numbers (A000959).A057612
Numbers that are both Mersenne numbers (A001348) and lucky numbers (A000959).
- Numbers that are both lucky numbers (A000959) and of form 2^k-1 (A000225).A057613
Numbers that are both lucky numbers (A000959) and of form 2^k-1 (A000225).
- a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), otherwise 11*a(n)+1.A057614
a(n+1) = a(n)/2 if 2|a(n), a(n)/3 if 3|a(n), a(n)/5 if 5|a(n), a(n)/7 if 7|a(n), otherwise 11*a(n)+1.
- ATS: Add Then Sort (i.e., double previous term and then sort digits).A057615
ATS: Add Then Sort (i.e., double previous term and then sort digits).
- Lucky numbers that are the product of the first m lucky numbers for some m.A057616
Lucky numbers that are the product of the first m lucky numbers for some m.
- Order of subgroup bP_{m+1} of group Theta_m of h-cobordism classes of smooth homotopy m-spheres defined by those homotopy m-spheres which bound parallelizable (m+1)-manifolds, where m = 2n+1.A057617
Order of subgroup bP_{m+1} of group Theta_m of h-cobordism classes of smooth homotopy m-spheres defined by those homotopy m-spheres which bound parallelizable (m+1)-manifolds, where m = 2n+1.
- Initial prime in first sequence of n primes congruent to 1 modulo 5.A057618
Initial prime in first sequence of n primes congruent to 1 modulo 5.
- Initial prime in first sequence of n primes congruent to 3 modulo 4.A057619
Initial prime in first sequence of n primes congruent to 3 modulo 4.
- Initial prime in first sequence of n consecutive primes congruent to 1 modulo 6.A057620
Initial prime in first sequence of n consecutive primes congruent to 1 modulo 6.
- Initial prime in first sequence of n primes congruent to 2 modulo 3.A057621
Initial prime in first sequence of n primes congruent to 2 modulo 3.
- Initial prime in first sequence of n consecutive primes congruent to 5 modulo 6.A057622
Initial prime in first sequence of n consecutive primes congruent to 5 modulo 6.
- a(n) = n! * (sum of reciprocals of all parts in unrestricted partitions of n).A057623
a(n) = n! * (sum of reciprocals of all parts in unrestricted partitions of n).
- Initial prime in first sequence of n primes congruent to 1 modulo 4.A057624
Initial prime in first sequence of n primes congruent to 1 modulo 4.
- a(n) = n! * sum 1/k! where the sum is over all positive integers k that divide n.A057625
a(n) = n! * sum 1/k! where the sum is over all positive integers k that divide n.
- Initial prime in first sequence of n primes congruent to 2 modulo 5.A057626
Initial prime in first sequence of n primes congruent to 2 modulo 5.
- Number of nonsquarefree numbers not exceeding n.A057627
Number of nonsquarefree numbers not exceeding n.
- Primes such that replacing each digit d with d copies of the digit d produces a prime. Zeros are not allowed.A057628
Primes such that replacing each digit d with d copies of the digit d produces a prime. Zeros are not allowed.
- Number of alternating sign 2n X 2n matrices invariant under flips in both diagonals.A057629
Number of alternating sign 2n X 2n matrices invariant under flips in both diagonals.
- Primes such that replacing each digit d with d copies of the digit d produces a prime. Zeros are allowed.A057630
Primes such that replacing each digit d with d copies of the digit d produces a prime. Zeros are allowed.
- Initial prime in first sequence of n primes congruent to 3 modulo 5.A057631
Initial prime in first sequence of n primes congruent to 3 modulo 5.
- Initial prime in first sequence of n primes congruent to 3 modulo 8.A057632
Initial prime in first sequence of n primes congruent to 3 modulo 8.
- Initial prime in first sequence of n primes congruent to 5 modulo 8.A057633
Initial prime in first sequence of n primes congruent to 5 modulo 8.
- Initial prime in first sequence of n primes congruent to 7 modulo 8.A057634
Initial prime in first sequence of n primes congruent to 7 modulo 8.
- a(n) is the largest m such that phi(m) = n, where phi is Euler's totient function = A000010, or a(n) = 0 if no such m exists.A057635
a(n) is the largest m such that phi(m) = n, where phi is Euler's totient function = A000010, or a(n) = 0 if no such m exists.
- Initial prime in first sequence of n primes congruent to 4 modulo 5. The first prime in a sequence of length n all ending with the digit 9.A057636
Initial prime in first sequence of n primes congruent to 4 modulo 5. The first prime in a sequence of length n all ending with the digit 9.
- a(n) is the largest number k such that sigma(k) = n, where sigma is the sum of divisors function A000203, or 0 if no such k exists.A057637
a(n) is the largest number k such that sigma(k) = n, where sigma is the sum of divisors function A000203, or 0 if no such k exists.
- Initial prime in first sequence of n primes congruent to 1 modulo 8.A057638
Initial prime in first sequence of n primes congruent to 1 modulo 8.
- First differences of zero-sites (A028442) of Mertens's function A002321.A057639
First differences of zero-sites (A028442) of Mertens's function A002321.
- a(n) = floor(H(n) + exp(H(n))*log(H(n))), where H(n) = Sum_{k=1..n} 1/k.A057640
a(n) = floor(H(n) + exp(H(n))*log(H(n))), where H(n) = Sum_{k=1..n} 1/k.
- a(n) = floor(H(n) + exp(H(n))*log(H(n))) - sigma(n), where H(n) = Sum_{k=1..n} 1/k and sigma(n) (A000203) is the sum of the divisors of n.A057641
a(n) = floor(H(n) + exp(H(n))*log(H(n))) - sigma(n), where H(n) = Sum_{k=1..n} 1/k and sigma(n) (A000203) is the sum of the divisors of n.
- (Product k^k) * (Sum 1/k^k) where both the sum and product are over those positive integers k that divide n.A057642
(Product k^k) * (Sum 1/k^k) where both the sum and product are over those positive integers k that divide n.
- Least common multiple of all (k+1)'s, where the k's are the positive divisors of n.A057643
Least common multiple of all (k+1)'s, where the k's are the positive divisors of n.
- Initial prime in first sequence of n primes congruent to 1 modulo 9.A057644
Initial prime in first sequence of n primes congruent to 1 modulo 9.
- Initial prime in first sequence of n primes congruent to 2 modulo 9.A057645
Initial prime in first sequence of n primes congruent to 2 modulo 9.
- a(n) is the number of trinomials x^n + x^k + 1 that are irreducible over GF(2) for some k with n > k > 0.A057646
a(n) is the number of trinomials x^n + x^k + 1 that are irreducible over GF(2) for some k with n > k > 0.
- Number of walks of length n on the upper-right part of the hexagonal lattice.A057647
Number of walks of length n on the upper-right part of the hexagonal lattice.
- Number of excursions of length n on the upper-right part of the hexagonal lattice.A057648
Number of excursions of length n on the upper-right part of the hexagonal lattice.
- Nearest integer to ratio of volume of n-dimensional cube of side 2 to volume of n-dimensional ball of radius 1.A057649
Nearest integer to ratio of volume of n-dimensional cube of side 2 to volume of n-dimensional ball of radius 1.
- Second step in Goodstein sequences, i.e., g(4) if g(2)=n: (first step) write g(2)=n in hereditary representation base 2, bump to base 3, then subtract 1 to produce g(3)=A056004(n), then (second step) write g(3) in hereditary representation base 3, bump to base 4, then subtract 1 to produce g(4).A057650
Second step in Goodstein sequences, i.e., g(4) if g(2)=n: (first step) write g(2)=n in hereditary representation base 2, bump to base 3, then subtract 1 to produce g(3)=A056004(n), then (second step) write g(3) in hereditary representation base 3, bump to base 4, then subtract 1 to produce g(4).
- a(n) = (3*5^n - 1)/2.A057651
a(n) = (3*5^n - 1)/2.
- Numbers n such that n-2^k is a lucky number for all k such that 1 < 2^k < n.A057652
Numbers n such that n-2^k is a lucky number for all k such that 1 < 2^k < n.
- Odd numbers of form x^2 + y^2.A057653
Odd numbers of form x^2 + y^2.
- Numbers n such that sigma(n)^2 - phi(n)^2 is a perfect square.A057654
Numbers n such that sigma(n)^2 - phi(n)^2 is a perfect square.
- The circle problem: number of points (x,y) in square lattice with x^2 + y^2 <= n.A057655
The circle problem: number of points (x,y) in square lattice with x^2 + y^2 <= n.
- Number of points (x,y) in square lattice with (x-1/2)^2+y^2 <= n.A057656
Number of points (x,y) in square lattice with (x-1/2)^2+y^2 <= n.
- Maximal size of binary code of length n that corrects one transposition (end-around transposition included).A057657
Maximal size of binary code of length n that corrects one transposition (end-around transposition included).
- a(n) = n*(n+1)^2*(n+2)^3*(n+3)^2*(n+4).A057658
a(n) = n*(n+1)^2*(n+2)^3*(n+3)^2*(n+4).
- Prime numbers whose square is composed of just two different decimal digits.A057659
Prime numbers whose square is composed of just two different decimal digits.
- a(n) = Sum_{k=1..n} n/gcd(n,k).A057660
a(n) = Sum_{k=1..n} n/gcd(n,k).