Sequences
392,541 sequences
- Smallest prime p such that n = A049108(p) = length of chain of iterates of Euler Phi starting with p.A060611
Smallest prime p such that n = A049108(p) = length of chain of iterates of Euler Phi starting with p.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=4 and D varies.A060612
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=4 and D varies.
- Number of n X n {-1,0,1} matrices with no zero rows.A060613
Number of n X n {-1,0,1} matrices with no zero rows.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=5 and D varies.A060614
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=5 and D varies.
- Number of conjugacy classes in the group GL_2(K) when K is a finite field with q = p^m for a prime p and m >= 1.A060615
Number of conjugacy classes in the group GL_2(K) when K is a finite field with q = p^m for a prime p and m >= 1.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=6 and D varies.A060616
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=6 and D varies.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=7 and D varies.A060617
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=7 and D varies.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=8 and D varies.A060618
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=8 and D varies.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=9 and D varies.A060619
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here d=9 and D varies.
- Average of the first n primes rounded down.A060620
Average of the first n primes rounded down.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 3 and d varies.A060621
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 3 and d varies.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 4 and d varies.A060622
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 4 and d varies.
- Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 5 and d varies.A060623
Number of flips between the d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 5 and d varies.
- Number d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 5 and d varies.A060624
Number d-dimensional tilings of the unary zonotope Z(D,d). Here the codimension D-d is equal to 5 and d varies.
- Decimal representation if A023532 is binary.A060625
Decimal representation if A023532 is binary.
- Number of right triangles of a given area required to form successively larger squares.A060626
Number of right triangles of a given area required to form successively larger squares.
- 1 + Sum_{n >= 1} Sum_{k = 0..n-1} (-1)^n*T(n,k)*y^(2*k)*x^(2*n)/(2*n)! = JacobiCN(x,y).A060627
1 + Sum_{n >= 1} Sum_{k = 0..n-1} (-1)^n*T(n,k)*y^(2*k)*x^(2*n)/(2*n)! = JacobiCN(x,y).
- Triangle of coefficients in expansion of elliptic function sn(u) in powers of u and k.A060628
Triangle of coefficients in expansion of elliptic function sn(u) in powers of u and k.
- 1/2+Sum_{n >= 1} a(n)*x^(2*n)/(4^n*(2*n)!) = 1/Pi*EllipticK(x).A060629
1/2+Sum_{n >= 1} a(n)*x^(2*n)/(4^n*(2*n)!) = 1/Pi*EllipticK(x).
- a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.A060630
a(n) gives smallest number requiring n iterations of the map i -> A053392(i) to reach zero.
- Number of independent sets in an n-dimensional hypercube modulo symmetries of the hypercube.A060631
Number of independent sets in an n-dimensional hypercube modulo symmetries of the hypercube.
- a(n) = 2^wt(floor(n/2)) (i.e., 2^A000120(floor(n/2)), or A001316(floor(n/2))).A060632
a(n) = 2^wt(floor(n/2)) (i.e., 2^A000120(floor(n/2)), or A001316(floor(n/2))).
- Surround numbers of an n X 1 rectangle.A060633
Surround numbers of an n X 1 rectangle.
- Union of Fibonacci numbers and prime numbers.A060634
Union of Fibonacci numbers and prime numbers.
- a(n) is the number of 2 X 1 domino tilings of the set S in the plane R^2 consisting of the union of the following two rectangles: rectangle1: |x| <= n, |y| <= 1, rectangle2: |x| <= 1, |y| <= n.A060635
a(n) is the number of 2 X 1 domino tilings of the set S in the plane R^2 consisting of the union of the following two rectangles: rectangle1: |x| <= n, |y| <= 1, rectangle2: |x| <= 1, |y| <= n.
- A060448 sorted and duplicates removed.A060636
A060448 sorted and duplicates removed.
- Triangle T(n,k) (0 <= k <= n) giving number of tilings of the k-dimensional zonotope constructed from n vectors.A060637
Triangle T(n,k) (0 <= k <= n) giving number of tilings of the k-dimensional zonotope constructed from n vectors.
- Triangle T(n,k) (0 <= k <= n) giving number of edges in the "flip graph" whose nodes are tilings of the k-dimensional zonotope constructed from n vectors.A060638
Triangle T(n,k) (0 <= k <= n) giving number of edges in the "flip graph" whose nodes are tilings of the k-dimensional zonotope constructed from n vectors.
- Number of pairs of partitions of [n] whose join is the partition {{1,2,...,n}}.A060639
Number of pairs of partitions of [n] whose join is the partition {{1,2,...,n}}.
- If n = Product p_i^e_i then a(n) = Product (1 + 2*p_i + 3*p_i^2 + ... + (e_i+1)*p_i^e_i).A060640
If n = Product p_i^e_i then a(n) = Product (1 + 2*p_i + 3*p_i^2 + ... + (e_i+1)*p_i^e_i).
- Surround numbers of a length 2n zig-zag.A060641
Surround numbers of a length 2n zig-zag.
- Triangle read by rows: row n lists number of ordered partitions into k parts of partitions of n.A060642
Triangle read by rows: row n lists number of ordered partitions into k parts of partitions of n.
- Number of conjugacy classes in the symmetric group S_n that have even number of elements.A060643
Number of conjugacy classes in the symmetric group S_n that have even number of elements.
- a(n) = floor((n+1)^(n+1)/n^n).A060644
a(n) = floor((n+1)^(n+1)/n^n).
- a(0) = 0, a(1) = 4, then a(n) = 18*a(n-1) - a(n-2).A060645
a(0) = 0, a(1) = 4, then a(n) = 18*a(n-1) - a(n-2).
- Bonse sequence: a(n) = minimal j such that n-j+1 < prime(j).A060646
Bonse sequence: a(n) = minimal j such that n-j+1 < prime(j).
- Number of alpha-beta evaluations in a tree of depth n and branching factor b=3.A060647
Number of alpha-beta evaluations in a tree of depth n and branching factor b=3.
- Number of cyclic subgroups of the group C_n X C_n (where C_n is the cyclic group of order n).A060648
Number of cyclic subgroups of the group C_n X C_n (where C_n is the cyclic group of order n).
- Smallest squarefree number k == 3 (mod 4) such that Q(sqrt(-k)) has class number n, or 0 if no such k exists.A060649
Smallest squarefree number k == 3 (mod 4) such that Q(sqrt(-k)) has class number n, or 0 if no such k exists.
- Numbers n such that there exist exactly one non-Abelian group of order n, i.e., such that A060689(n) = 1.A060650
Numbers n such that there exist exactly one non-Abelian group of order n, i.e., such that A060689(n) = 1.
- Smallest odd prime p such that Q(sqrt(-p)) has class number 2n+1.A060651
Smallest odd prime p such that Q(sqrt(-p)) has class number 2n+1.
- Orders of non-Abelian groups: n such that some group of order n is non-Abelian.A060652
Orders of non-Abelian groups: n such that some group of order n is non-Abelian.
- Minimal number of conjugacy classes (which is also the number of irreducible representations) in G where G is a finite group of order n.A060653
Minimal number of conjugacy classes (which is also the number of irreducible representations) in G where G is a finite group of order n.
- a(n) = gcd(n, A060766(n)).A060654
a(n) = gcd(n, A060766(n)).
- Pack n integer-sided rectangles into the smallest possible square so that no sides of the rectangle are the same. Sequence gives the side of the smallest square.A060655
Pack n integer-sided rectangles into the smallest possible square so that no sides of the rectangle are the same. Sequence gives the side of the smallest square.
- a(n) = 2*a(n-1)*a(n-2)/a(n-3), with a(0)=a(1)=1.A060656
a(n) = 2*a(n-1)*a(n-2)/a(n-3), with a(0)=a(1)=1.
- Odd values of the sum-of-divisors function sigma (A000203) (without repetitions).A060657
Odd values of the sum-of-divisors function sigma (A000203) (without repetitions).
- Even numbers n such that sigma(x) = n has no solution.A060658
Even numbers n such that sigma(x) = n has no solution.
- a(n) = smallest number of squares on a checkerboard that has exactly n domino tilings.A060659
a(n) = smallest number of squares on a checkerboard that has exactly n domino tilings.
- Numbers k such that sigma(x) = k has exactly 4 solutions.A060660
Numbers k such that sigma(x) = k has exactly 4 solutions.