Sequences
392,541 sequences
- Multiplicative order of 11 mod n, where gcd(n, 11) = 1.A054711
Multiplicative order of 11 mod n, where gcd(n, 11) = 1.
- Number of powers of 12 modulo n.A054712
Number of powers of 12 modulo n.
- Number of powers of 13 modulo n.A054713
Number of powers of 13 modulo n.
- Number of powers of 14 modulo n.A054714
Number of powers of 14 modulo n.
- Number of powers of 15 modulo n.A054715
Number of powers of 15 modulo n.
- Number of powers of 16 modulo n.A054716
Number of powers of 16 modulo n.
- Number of powers of 9 modulo n.A054717
Number of powers of 9 modulo n.
- Number of ternary sequences with primitive period n.A054718
Number of ternary sequences with primitive period n.
- Number of 4-ary sequences with primitive period n.A054719
Number of 4-ary sequences with primitive period n.
- Number of 5-ary sequences with primitive period n.A054720
Number of 5-ary sequences with primitive period n.
- Number of 6-ary sequences with primitive period n.A054721
Number of 6-ary sequences with primitive period n.
- Triangle of coefficients of polynomials arising in enumeration of periodic sequences.A054722
Triangle of coefficients of polynomials arising in enumeration of periodic sequences.
- Prime exponents of composite Mersenne numbers.A054723
Prime exponents of composite Mersenne numbers.
- Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group.A054724
Triangle of numbers of inequivalent Boolean functions of n variables with exactly k nonzero values (atoms) under action of complementing group.
- a(1)=1; a(n) = Sum_{p | n} e * a(p-1), where sum is over all primes p that divide n, and e is the multiplicity of p in n.A054725
a(1)=1; a(n) = Sum_{p | n} e * a(p-1), where sum is over all primes p that divide n, and e is the multiplicity of p in n.
- Number of graphs with n nodes on a circle without crossing edges.A054726
Number of graphs with n nodes on a circle without crossing edges.
- Number of forests of rooted trees with n nodes on a circle without crossing edges.A054727
Number of forests of rooted trees with n nodes on a circle without crossing edges.
- a(n) is the smallest level N such that genus of modular curve X_0(N) is n (or -1 if no such curve exists).A054728
a(n) is the smallest level N such that genus of modular curve X_0(N) is n (or -1 if no such curve exists).
- Numbers n such that genus of modular curve X_0(N) is never equal to n.A054729
Numbers n such that genus of modular curve X_0(N) is never equal to n.
- Odd n such that genus of modular curve X_0(N) is never equal to n.A054730
Odd n such that genus of modular curve X_0(N) is never equal to n.
- Numbers of the form x*(x + 1)*y*(y + 1)/4 where x and y are distinct.A054731
Numbers of the form x*(x + 1)*y*(y + 1)/4 where x and y are distinct.
- Number of inequivalent n-state 2-input 2-output automata with respect to input and output permutations.A054732
Number of inequivalent n-state 2-input 2-output automata with respect to input and output permutations.
- Triangle of number of (weakly) connected unlabeled digraphs with n nodes and k arcs (n >=2, k >= 1).A054733
Triangle of number of (weakly) connected unlabeled digraphs with n nodes and k arcs (n >=2, k >= 1).
- Numbers of the form 2*x*(x + 1)*y*(y + 1) where x and y are distinct.A054734
Numbers of the form 2*x*(x + 1)*y*(y + 1) where x and y are distinct.
- Sums of twin prime pairs.A054735
Sums of twin prime pairs.
- Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".A054736
Smallest losing position after your opponent has taken k stones in a variation of "Fibonacci Nim".
- Numbers n such that n^2 can be split into two nonzero squares (perhaps with leading zeros) in exactly two different ways.A054737
Numbers n such that n^2 can be split into two nonzero squares (perhaps with leading zeros) in exactly two different ways.
- Squares which can be split into two nonzero squares (perhaps with leading zeros) in exactly two different ways.A054738
Squares which can be split into two nonzero squares (perhaps with leading zeros) in exactly two different ways.
- Number of inequivalent n X n matrices over GF(3) under action of dihedral group of the square D_4.A054739
Number of inequivalent n X n matrices over GF(3) under action of dihedral group of the square D_4.
- Cototient(n)/totient(n) when this is an integer.A054740
Cototient(n)/totient(n) when this is an integer.
- Numbers m such that totient(m) < cototient(m).A054741
Numbers m such that totient(m) < cototient(m).
- Finite automata.A054742
Finite automata.
- If n = Product p_i^e_i then p_i < e_i (where e_i > 0) for all i.A054743
If n = Product p_i^e_i then p_i < e_i (where e_i > 0) for all i.
- p-full numbers: numbers such that if any prime p divides it, then so does p^p.A054744
p-full numbers: numbers such that if any prime p divides it, then so does p^p.
- Number of nonisomorphic binary n-state automata without output under input permutations.A054745
Number of nonisomorphic binary n-state automata without output under input permutations.
- Number of nonisomorphic connected binary n-state automata without output under input permutations.A054746
Number of nonisomorphic connected binary n-state automata without output under input permutations.
- Number of inequivalent n-state 2-input 2-output automata with respect to an input permutation.A054747
Number of inequivalent n-state 2-input 2-output automata with respect to an input permutation.
- Number of inequivalent n-state 1-input n-output automata.A054748
Number of inequivalent n-state 1-input n-output automata.
- Number of inequivalent connected n-state 1-input n-output automata.A054749
Number of inequivalent connected n-state 1-input n-output automata.
- Smallest prime number whose digits sum to n-th prime.A054750
Smallest prime number whose digits sum to n-th prime.
- Number of inequivalent n X n matrices over GF(4) under action of dihedral group of the square D_4.A054751
Number of inequivalent n X n matrices over GF(4) under action of dihedral group of the square D_4.
- Number of inequivalent n X n matrices over GF(5) under action of dihedral group of the square D_4.A054752
Number of inequivalent n X n matrices over GF(5) under action of dihedral group of the square D_4.
- Numbers which are the product of a prime and the square of a different prime (p^2 * q).A054753
Numbers which are the product of a prime and the square of a different prime (p^2 * q).
- Totient(n) and cototient(n) are squares.A054754
Totient(n) and cototient(n) are squares.
- Odd powers of primes of the form q = x^2 + 1 (A002496).A054755
Odd powers of primes of the form q = x^2 + 1 (A002496).
- Numbers k such that phi(k) and cototient(k) are squares but k is not in A054755.A054756
Numbers k such that phi(k) and cototient(k) are squares but k is not in A054755.
- Smallest prime of the form m*Q(n) + r where Q(n) = A002110(n) (the n-th primorial) and r = prime(n+1)^2.A054757
Smallest prime of the form m*Q(n) + r where Q(n) = A002110(n) (the n-th primorial) and r = prime(n+1)^2.
- a(n) is the smallest multiplier w such that A002110(n)*w + prime(n+1)^2 is prime.A054758
a(n) is the smallest multiplier w such that A002110(n)*w + prime(n+1)^2 is prime.
- Number of Eulerian orientations of the n X n square lattice (with wrap-around), i.e., number of arrow configurations on n X n grid that satisfy the square ice rule.A054759
Number of Eulerian orientations of the n X n square lattice (with wrap-around), i.e., number of arrow configurations on n X n grid that satisfy the square ice rule.
- Table T(n,k) = order of (n,k)-cage (smallest n-regular graph of girth k), n >= 2, k >= 3, read by antidiagonals.A054760
Table T(n,k) = order of (n,k)-cage (smallest n-regular graph of girth k), n >= 2, k >= 3, read by antidiagonals.