Sequences
392,541 sequences
- Quotient: squarefree kernel of A002944(n) divided by that of A001405.A056611
Quotient: squarefree kernel of A002944(n) divided by that of A001405.
- a(n) = gcd(n!, n!*(1 + 1/2 + 1/3 + ... + 1/n)).A056612
a(n) = gcd(n!, n!*(1 + 1/2 + 1/3 + ... + 1/n)).
- Number of n-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection.A056613
Number of n-celled pseudo still lifes in Conway's Game of Life, up to rotation and reflection.
- Number of n-celled P2-oscillators in Conway's game of Life.A056614
Number of n-celled P2-oscillators in Conway's game of Life.
- Binomial(2*n - 1, n - 1) - 1 (mod n^2).A056615
Binomial(2*n - 1, n - 1) - 1 (mod n^2).
- Numerator of binomial(2n,n)/(2n+1).A056616
Numerator of binomial(2n,n)/(2n+1).
- Denominator of binomial(2*n,n) / (2*n+1).A056617
Denominator of binomial(2*n,n) / (2*n+1).
- Concatenate factorials.A056618
Concatenate factorials.
- Smallest prime with primitive root n, or 0 if no such prime exists.A056619
Smallest prime with primitive root n, or 0 if no such prime exists.
- Partition function coefficients for square lattice spin 3 Ising model.A056620
Partition function coefficients for square lattice spin 3 Ising model.
- a(n) is the total radius of gyration of all self-avoiding polygons of length 2n on the square lattice.A056621
a(n) is the total radius of gyration of all self-avoiding polygons of length 2n on the square lattice.
- a(n) = A000188(n)/A055229(n).A056622
a(n) = A000188(n)/A055229(n).
- If n=LLgggf (see A056192) and a(n) = LL, then its complementary divisor n/LL = gggf and gcd(L^2, n/LL) = 1.A056623
If n=LLgggf (see A056192) and a(n) = LL, then its complementary divisor n/LL = gggf and gcd(L^2, n/LL) = 1.
- Number of unitary square divisors of n.A056624
Number of unitary square divisors of n.
- a(n) is the total area of all self-avoiding polygons of length 2n on the square lattice.A056625
a(n) is the total area of all self-avoiding polygons of length 2n on the square lattice.
- Number of non-unitary square divisors of n.A056626
Number of non-unitary square divisors of n.
- a(n) = A056622(n!).A056627
a(n) = A056622(n!).
- a(n) = A056623(n!).A056628
a(n) = A056623(n!).
- a(n) = A034444(A056627(n)).A056629
a(n) = A034444(A056627(n)).
- a(n) = A055993(n) - A034444(A056627(n)).A056630
a(n) = A055993(n) - A034444(A056627(n)).
- a(n) is the total second area moment of all self-avoiding polygons of length 2n on the square lattice.A056631
a(n) is the total second area moment of all self-avoiding polygons of length 2n on the square lattice.
- a(n) is the total perimeter of all self-avoiding polygons of area n on the square lattice.A056632
a(n) is the total perimeter of all self-avoiding polygons of area n on the square lattice.
- a(n) is the total squared perimeter of all self-avoiding polygons of area n on the square lattice.A056633
a(n) is the total squared perimeter of all self-avoiding polygons of area n on the square lattice.
- Number of polygons of length 2n with one hole on square lattice (not allowing rotations).A056634
Number of polygons of length 2n with one hole on square lattice (not allowing rotations).
- Difference between length (A005341) and sum of digits (A004977) of n-th term in Look and Say Sequence (A005150).A056635
Difference between length (A005341) and sum of digits (A004977) of n-th term in Look and Say Sequence (A005150).
- Conjecturally largest even integer which is the sum of two primes in at most n ways.A056636
Conjecturally largest even integer which is the sum of two primes in at most n ways.
- a(n) is the least prime of class n-, according to the Erdős-Selfridge classification of primes.A056637
a(n) is the least prime of class n-, according to the Erdős-Selfridge classification of primes.
- Number of polygons of length 2n with two (self-avoiding polygon) holes on square lattice (not allowing rotations).A056638
Number of polygons of length 2n with two (self-avoiding polygon) holes on square lattice (not allowing rotations).
- Number of polygons of length 2n with 3 (self-avoiding polygon) holes on square lattice (not allowing rotations).A056639
Number of polygons of length 2n with 3 (self-avoiding polygon) holes on square lattice (not allowing rotations).
- At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.A056640
At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.
- Least positive integer k for which (b+1)^k is not palindromic in base b, b = 2, 3, 4, ...A056641
Least positive integer k for which (b+1)^k is not palindromic in base b, b = 2, 3, 4, ...
- Number of linear spaces on n (labeled) points.A056642
Number of linear spaces on n (labeled) points.
- Numbers n such that n | 4^n + 3^n + 2^n + 1^n.A056643
Numbers n such that n | 4^n + 3^n + 2^n + 1^n.
- Duplicate of A007813.A056644
Duplicate of A007813.
- Numbers n such that n | 3^n + 2^n + 1^n.A056645
Numbers n such that n | 3^n + 2^n + 1^n.
- a(n) = A056622(A001405(n)).A056646
a(n) = A056622(A001405(n)).
- a(n) = A056623(A001405(n)).A056647
a(n) = A056623(A001405(n)).
- a(n) = A034444(A056647(n)).A056648
a(n) = A034444(A056647(n)).
- a(n) = A056061(n) - A034444(A056647(n)).A056649
a(n) = A056061(n) - A034444(A056647(n)).
- a(n) is the greatest prime factor of a(n-1)^2+a(n-1)+1.A056650
a(n) is the greatest prime factor of a(n-1)^2+a(n-1)+1.
- Numbers k such that binomial(k,floor(k/2)) has no non-unitary square divisors: all of their square divisors are unitary ones.A056651
Numbers k such that binomial(k,floor(k/2)) has no non-unitary square divisors: all of their square divisors are unitary ones.
- Integers > 1 whose prime divisors are all Mersenne primes (i.e., of the form (2^p - 1)).A056652
Integers > 1 whose prime divisors are all Mersenne primes (i.e., of the form (2^p - 1)).
- Composite numbers together with 1 but excluding 4.A056653
Composite numbers together with 1 but excluding 4.
- Numbers k such that 10*R_k + 3 is prime, where R_k is the repunit (A002275) of length k.A056654
Numbers k such that 10*R_k + 3 is prime, where R_k is the repunit (A002275) of length k.
- Numbers k such that 10*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056655
Numbers k such that 10*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 20*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056656
Numbers k such that 20*R_k + 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 60*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056657
Numbers k such that 60*R_k + 7 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 60*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056658
Numbers k such that 60*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 10*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A056659
Numbers k such that 10*R_k + 9 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Numbers k such that 20*R_k + 1 is a prime, where R_k = 11...1 is the repunit (A002275) of length k.A056660
Numbers k such that 20*R_k + 1 is a prime, where R_k = 11...1 is the repunit (A002275) of length k.