Sequences
392,541 sequences
- Least nonnegative cube root of 2 mod n for n in A057760.A057761
Least nonnegative cube root of 2 mod n for n in A057760.
- Numbers k such that 5 is a square mod k.A057762
Numbers k such that 5 is a square mod k.
- Least nonnegative square root of 5 mod n for n in A057762.A057763
Least nonnegative square root of 5 mod n for n in A057762.
- Triangle T(n,k) = number of nonzero elements of multiplicative order k in Galois field GF(2^n) (n >= 1, 1 <= k <= 2^n-1).A057764
Triangle T(n,k) = number of nonzero elements of multiplicative order k in Galois field GF(2^n) (n >= 1, 1 <= k <= 2^n-1).
- Number of factorable subsets of a 1 X n uniform grid.A057765
Number of factorable subsets of a 1 X n uniform grid.
- Total area of all n-celled polyominoes.A057766
Total area of all n-celled polyominoes.
- Number of twin prime pairs between P(n)^2 and P(n+1)^2 where P(n) is the n-th prime.A057767
Number of twin prime pairs between P(n)^2 and P(n+1)^2 where P(n) is the n-th prime.
- From Goldbach problem: number of decompositions of 2n-1 into sum of a prime lucky number(from A031157) and a twin even-lucky-number(from A045955, A045956).A057768
From Goldbach problem: number of decompositions of 2n-1 into sum of a prime lucky number(from A031157) and a twin even-lucky-number(from A045955, A045956).
- a(n) = 4*n^4 + 8*n^3 - 4*n - 1 = (2*n^2 - 1)*(2*n^2 + 4*n + 1).A057769
a(n) = 4*n^4 + 8*n^3 - 4*n - 1 = (2*n^2 - 1)*(2*n^2 + 4*n + 1).
- The primes in A045574.A057770
The primes in A045574.
- Number of loops (quasigroups with an identity element) of order n.A057771
Number of loops (quasigroups with an identity element) of order n.
- Inverse Euler transform of A000016.A057772
Inverse Euler transform of A000016.
- a(n) = Sum_{i=1..n} nu_2(prime(i) - 1) where nu_2(m) = exponent of highest power of 2 dividing m.A057773
a(n) = Sum_{i=1..n} nu_2(prime(i) - 1) where nu_2(m) = exponent of highest power of 2 dividing m.
- Values of k corresponding to A073571.A057774
Values of k corresponding to A073571.
- a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).A057775
a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).
- a(n) is the least number k such that prime(k) - 1 is divisible by 2^(n-1) and the quotient is odd.A057776
a(n) is the least number k such that prime(k) - 1 is divisible by 2^(n-1) and the quotient is odd.
- a(n) is the smallest number such that a(n)+1 is a prime and the largest power of 2 which divides it is 2^n.A057777
a(n) is the smallest number such that a(n)+1 is a prime and the largest power of 2 which divides it is 2^n.
- a(n) is the least odd k such that k*2^n + 1 is prime.A057778
a(n) is the least odd k such that k*2^n + 1 is prime.
- Number of hexagonal polyominoes (or polyhexes, A000228) with perimeter 2n.A057779
Number of hexagonal polyominoes (or polyhexes, A000228) with perimeter 2n.
- Multiples of 3 that are one less than a perfect square.A057780
Multiples of 3 that are one less than a perfect square.
- a(n) = n^4+4 = (n^2-2*n+2)*(n^2+2*n+2) = ((n-1)^2+1)*((n+1)^2+1).A057781
a(n) = n^4+4 = (n^2-2*n+2)*(n^2+2*n+2) = ((n-1)^2+1)*((n+1)^2+1).
- Building block is trapezoid formed from 3 equilateral triangles; sequence gives number of pieces (polytraps) that can be formed from n such trapezoids.A057782
Building block is trapezoid formed from 3 equilateral triangles; sequence gives number of pieces (polytraps) that can be formed from n such trapezoids.
- Building block is 2 hexagons side-by-side; sequence gives number of pieces (polydohexes) that can be formed from n such pairs of hexagons.A057783
Building block is 2 hexagons side-by-side; sequence gives number of pieces (polydohexes) that can be formed from n such pairs of hexagons.
- Number of polypons with n cells.A057784
Number of polypons with n cells.
- Erroneous version of A355562.A057785
Erroneous version of A355562.
- Number of polykites with n cells.A057786
Number of polykites with n cells.
- Number of polyarcs with n cells.A057787
Number of polyarcs with n cells.
- Expansion of (1+x)/(1-x)^12.A057788
Expansion of (1+x)/(1-x)^12.
- a(n) = Sum_{k = 1..n, gcd(k,n)=1} k*(n-k).A057789
a(n) = Sum_{k = 1..n, gcd(k,n)=1} k*(n-k).
- Table read by antidiagonals: T(n,k) = number of restricted knight's walks from (n,k) (n >= 0, k >= 0).A057790
Table read by antidiagonals: T(n,k) = number of restricted knight's walks from (n,k) (n >= 0, k >= 0).
- Sum[k^(n-k)], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1.A057791
Sum[k^(n-k)], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1.
- Sum[k^k], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1.A057792
Sum[k^k], where sum is over positive integers, k, where k <= n and gcd(k,n) = 1.
- Integer nearest Riemann(10^n), where Riemann(x) = Sum_{k=1..infinity} mu(k)/k * Integral Log( x^(1/k) ).A057793
Integer nearest Riemann(10^n), where Riemann(x) = Sum_{k=1..infinity} mu(k)/k * Integral Log( x^(1/k) ).
- (Integer nearest R(10^n)) - pi(10^n), where pi(x) is the number of primes <= x, R(x) = Sum_{ k>=1 } (mu(k)/k * li(x^(1/k))) and li(x) is the Cauchy principal value of the integral from 0 to x of dt/log(t).A057794
(Integer nearest R(10^n)) - pi(10^n), where pi(x) is the number of primes <= x, R(x) = Sum_{ k>=1 } (mu(k)/k * li(x^(1/k))) and li(x) is the Cauchy principal value of the integral from 0 to x of dt/log(t).
- Sum k!, where sum is over positive integers k <= n with gcd(k,n) = 1.A057795
Sum k!, where sum is over positive integers k <= n with gcd(k,n) = 1.
- Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in deuces-wild poker.A057796
Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in deuces-wild poker.
- Number of ways of getting 5 of a kind, a straight flush, full house, flush, 4 of a kind, straight, 2 pair, 3 of a kind, a pair in deuces-wild poker.A057797
Number of ways of getting 5 of a kind, a straight flush, full house, flush, 4 of a kind, straight, 2 pair, 3 of a kind, a pair in deuces-wild poker.
- Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.A057798
Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.
- Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 1 joker.A057799
Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 1 joker.
- Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 2 pair, 3 of a kind, a pair in wild-card poker with 2 jokers.A057800
Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 2 pair, 3 of a kind, a pair in wild-card poker with 2 jokers.
- Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 2 pair, 3 of a kind, a pair in wild-card poker with 1 joker.A057801
Number of ways of getting 5 of a kind, a straight flush, 4 of a kind, full house, flush, straight, 2 pair, 3 of a kind, a pair in wild-card poker with 1 joker.
- Number of ways of getting (at least) 5 of a kind, a straight flush, flush, 4 of a kind, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with deuces wild.A057802
Number of ways of getting (at least) 5 of a kind, a straight flush, flush, 4 of a kind, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with deuces wild.
- Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.A057803
Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.
- Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 1 joker.A057804
Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 1 joker.
- Number of ways of getting (at least) 5 of a kind, a straight flush, flush, 4 of a kind, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with deuces wild.A057805
Number of ways of getting (at least) 5 of a kind, a straight flush, flush, 4 of a kind, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with deuces wild.
- Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.A057806
Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 2 jokers.
- Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 1 joker.A057807
Number of ways of getting (at least) 5 of a kind, a straight flush, 4 of a kind, flush, full house, straight, 3 of a kind, 2 pair, a pair in wild-card poker with 1 joker.
- Number of ways of getting (at least) a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in poker.A057808
Number of ways of getting (at least) a straight flush, 4 of a kind, full house, flush, straight, 3 of a kind, 2 pair, a pair in poker.
- Numbers k such that pi(k) divides k.A057809
Numbers k such that pi(k) divides k.
- Quotients n/pi(n) for n in A057809.A057810
Quotients n/pi(n) for n in A057809.