Sequences
392,541 sequences
- Log_b 8 where b is smallest primitive root (A001918) mod n-th prime.A054511
Log_b 8 where b is smallest primitive root (A001918) mod n-th prime.
- Log_b 9 where b is smallest primitive root (A001918) mod n-th prime.A054512
Log_b 9 where b is smallest primitive root (A001918) mod n-th prime.
- Log_b 10 where b is smallest primitive root (A001918) mod n-th prime.A054513
Log_b 10 where b is smallest primitive root (A001918) mod n-th prime.
- Number of ways to place non-crossing diagonals in convex (n+4)-gon so as to create no triangles or quadrilaterals.A054514
Number of ways to place non-crossing diagonals in convex (n+4)-gon so as to create no triangles or quadrilaterals.
- Number of ways to place non-intersecting diagonals in convex (n+2)-gon so as to create no quadrilaterals.A054515
Number of ways to place non-intersecting diagonals in convex (n+2)-gon so as to create no quadrilaterals.
- Equivalent of the Kurepa hypothesis for left factorial.A054516
Equivalent of the Kurepa hypothesis for left factorial.
- Duplicate of A054016.A054517
Duplicate of A054016.
- Emirpnons (nonprimes whose reversal is a different nonprime).A054518
Emirpnons (nonprimes whose reversal is a different nonprime).
- Number of increasing arithmetic progressions of nonnegative integers ending in n, including those of length 1 or 2.A054519
Number of increasing arithmetic progressions of nonnegative integers ending in n, including those of length 1 or 2.
- Let S = {1,5,9,13,..., 4n+1, ...} and call p in S an S-prime if p>1 and the only divisors of p in S are 1 and p; sequence gives elements of S that are not S-primes.A054520
Let S = {1,5,9,13,..., 4n+1, ...} and call p in S an S-prime if p>1 and the only divisors of p in S are 1 and p; sequence gives elements of S that are not S-primes.
- Triangle read by rows: T(n,k) = 1 if gcd(n, k) = 1, T(n,k) = 0 otherwise (n >= 1, 1 <= k <= n).A054521
Triangle read by rows: T(n,k) = 1 if gcd(n, k) = 1, T(n,k) = 0 otherwise (n >= 1, 1 <= k <= n).
- Triangle T(n,k): T(n,k) = phi(k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1<=k<=n). T(n,k) = number of elements of order k in cyclic group of order n.A054522
Triangle T(n,k): T(n,k) = phi(k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1<=k<=n). T(n,k) = number of elements of order k in cyclic group of order n.
- Triangle read by rows: T(n,k) = phi(n/k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1 <= k <= n).A054523
Triangle read by rows: T(n,k) = phi(n/k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1 <= k <= n).
- Triangle T(n,k): T(n,k) = mu(k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1<=k<=n).A054524
Triangle T(n,k): T(n,k) = mu(k) if k divides n, T(n,k)=0 otherwise (n >= 1, 1<=k<=n).
- Triangle T(n,k): T(n,k) = mu(n/k) if k divides n, T(n,k) = 0 otherwise (n >= 1, 1 <= k <= n).A054525
Triangle T(n,k): T(n,k) = mu(n/k) if k divides n, T(n,k) = 0 otherwise (n >= 1, 1 <= k <= n).
- Triangle T(n,k): T(n,k) = phi(k) (n >= 1, 1 <= k <= n).A054526
Triangle T(n,k): T(n,k) = phi(k) (n >= 1, 1 <= k <= n).
- Triangle read by rows: T(n,k) = Moebius mu(k) (n >= 1, 1 <= k <= n).A054527
Triangle read by rows: T(n,k) = Moebius mu(k) (n >= 1, 1 <= k <= n).
- Triangle T(n,k) giving number of codewords with k runs in Varshamov-Tenengolts code VT_0(n) of length n (n >= 1, 1<=k<=n).A054528
Triangle T(n,k) giving number of codewords with k runs in Varshamov-Tenengolts code VT_0(n) of length n (n >= 1, 1<=k<=n).
- Number of words with 3 runs in Varshamov-Tenengolts code VT_0(n) of length n.A054529
Number of words with 3 runs in Varshamov-Tenengolts code VT_0(n) of length n.
- Number of words with 4 runs in Varshamov-Tenengolts code VT_0(n) of length n.A054530
Number of words with 4 runs in Varshamov-Tenengolts code VT_0(n) of length n.
- Triangular array T read by rows: T(n,k) = n/gcd(n,k) (n >= 1, 1 <= k <= n).A054531
Triangular array T read by rows: T(n,k) = n/gcd(n,k) (n >= 1, 1 <= k <= n).
- Ramanujan sum T(n, k) = c_k(n) = Sum_{m=1..k, (m,k)=1} exp(2*Pi*i*m*n / k), triangular array read by rows for n >= 1 and 1 <= k <= n.A054532
Ramanujan sum T(n, k) = c_k(n) = Sum_{m=1..k, (m,k)=1} exp(2*Pi*i*m*n / k), triangular array read by rows for n >= 1 and 1 <= k <= n.
- Triangular array giving Ramanujan sum T(n,k) = c_n(k) = Sum_{m=1..n, (m,n)=1} exp(2 Pi i m k / n) for n >= 1 and 1 <= k <= n.A054533
Triangular array giving Ramanujan sum T(n,k) = c_n(k) = Sum_{m=1..n, (m,n)=1} exp(2 Pi i m k / n) for n >= 1 and 1 <= k <= n.
- Square array giving Ramanujan sum T(n,k) = c_k(n) = Sum_{m=1..k, (m,k)=1} exp(2 Pi i m n / k), read by antidiagonals upwards (n >= 1, k >= 1).A054534
Square array giving Ramanujan sum T(n,k) = c_k(n) = Sum_{m=1..k, (m,k)=1} exp(2 Pi i m n / k), read by antidiagonals upwards (n >= 1, k >= 1).
- Square array giving Ramanujan sum T(n,k) = c_n(k) = Sum_{m=1..n, (m,n)=1} exp(2 Pi i m k / n), read by antidiagonals upwards (n >= 1, k >= 1).A054535
Square array giving Ramanujan sum T(n,k) = c_n(k) = Sum_{m=1..n, (m,n)=1} exp(2 Pi i m k / n), read by antidiagonals upwards (n >= 1, k >= 1).
- Maximal size of binary code of length n and asymmetric distance 4.A054536
Maximal size of binary code of length n and asymmetric distance 4.
- Duplicate of A010336.A054537
Duplicate of A010336.
- A000013 / 2.A054538
A000013 / 2.
- A000016 / 2.A054539
A000016 / 2.
- A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the six simple ratios of musical harmony: 6/5, 5/4, 4/3, 3/2, 8/5 and 5/3.A054540
A list of equal temperaments (equal divisions of the octave) whose nearest scale steps are closer and closer approximations to the six simple ratios of musical harmony: 6/5, 5/4, 4/3, 3/2, 8/5 and 5/3.
- Sum of first n terms equals n-th prime.A054541
Sum of first n terms equals n-th prime.
- A Catalan-like sequence.A054542
A Catalan-like sequence.
- Engel series expansion (or "Egyptian product") for Catalan's constant G.A054543
Engel series expansion (or "Egyptian product") for Catalan's constant G.
- Engel series expansion (or "Egyptian product") for Khintchine's constant.A054544
Engel series expansion (or "Egyptian product") for Khintchine's constant.
- Number of labeled digraphs on n unisolated nodes (inverse binomial transform of A053763).A054545
Number of labeled digraphs on n unisolated nodes (inverse binomial transform of A053763).
- First differences of nonprimes (including 0 and 1, A002808).A054546
First differences of nonprimes (including 0 and 1, A002808).
- Triangular array giving number of labeled digraphs on n unisolated nodes and k=0..n*(n-1) arcs.A054547
Triangular array giving number of labeled digraphs on n unisolated nodes and k=0..n*(n-1) arcs.
- Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.A054548
Triangular array giving number of labeled graphs on n unisolated nodes and k=0...n*(n-1)/2 edges.
- Number of symmetric nonnegative integer 9 X 9 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.A054549
Number of symmetric nonnegative integer 9 X 9 matrices with sum of elements equal to 4*n, under action of dihedral group D_4.
- Composite numbers whose least prime factor is either 5 or 7.A054550
Composite numbers whose least prime factor is either 5 or 7.
- Prime number spiral (clockwise, North spoke).A054551
Prime number spiral (clockwise, North spoke).
- a(n) = 4*n^2 - 3*n + 1.A054552
a(n) = 4*n^2 - 3*n + 1.
- Prime number spiral (clockwise, Northeast spoke).A054553
Prime number spiral (clockwise, Northeast spoke).
- a(n) = 4*n^2 - 10*n + 7.A054554
a(n) = 4*n^2 - 10*n + 7.
- Prime number spiral (clockwise, East spoke).A054555
Prime number spiral (clockwise, East spoke).
- a(n) = 4*n^2 - 9*n + 6.A054556
a(n) = 4*n^2 - 9*n + 6.
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 10 1-simplexes.A054557
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 10 1-simplexes.
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 9 1-simplexes.A054558
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 9 1-simplexes.
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 8 1-simplexes.A054559
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 8 1-simplexes.
- Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 11 1-simplexes.A054560
Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 11 1-simplexes.