Sequences
392,541 sequences
- Number of n-crossing hyperbolic knots having symmetry group Z1.A052411
Number of n-crossing hyperbolic knots having symmetry group Z1.
- Number of n-crossing hyperbolic knots having symmetry group Z2.A052412
Number of n-crossing hyperbolic knots having symmetry group Z2.
- Numbers without 5 as a digit.A052413
Numbers without 5 as a digit.
- Numbers without 6 as a digit.A052414
Numbers without 6 as a digit.
- Number of n-crossing hyperbolic knots having symmetry group D1.A052415
Number of n-crossing hyperbolic knots having symmetry group D1.
- Number of n-crossing hyperbolic knots having symmetry group D2.A052416
Number of n-crossing hyperbolic knots having symmetry group D2.
- Number of n-crossing hyperbolic knots having symmetry group D3.A052417
Number of n-crossing hyperbolic knots having symmetry group D3.
- Number of n-crossing hyperbolic knots having symmetry group D4.A052418
Number of n-crossing hyperbolic knots having symmetry group D4.
- Numbers without 7 as a digit.A052419
Numbers without 7 as a digit.
- Number of n-crossing hyperbolic knots having symmetry group D6.A052420
Number of n-crossing hyperbolic knots having symmetry group D6.
- Numbers without 8 as a digit.A052421
Numbers without 8 as a digit.
- Number of n-crossing hyperbolic knots having symmetry group D8.A052422
Number of n-crossing hyperbolic knots having symmetry group D8.
- Highest common factor of nonzero digits of n.A052423
Highest common factor of nonzero digits of n.
- Numbers k with no single-digit factors (apart from 1 and k).A052424
Numbers k with no single-digit factors (apart from 1 and k).
- Numbers with no two-digit factors (apart from itself).A052425
Numbers with no two-digit factors (apart from itself).
- Numbers with no two-digit factors (including itself).A052426
Numbers with no two-digit factors (including itself).
- Baxter-Hickerson numbers.A052427
Baxter-Hickerson numbers.
- Strict Egyptian numbers (complement of A051882).A052428
Strict Egyptian numbers (complement of A051882).
- Least common multiple of nonzero digits of n.A052429
Least common multiple of nonzero digits of n.
- Numbers n such that sum of digits and product of digits are both prime.A052430
Numbers n such that sum of digits and product of digits are both prime.
- Number of perfect simple undirected graphs on n nodes.A052431
Number of perfect simple undirected graphs on n nodes.
- Smallest conductor of elliptic curve with rank n.A052432
Smallest conductor of elliptic curve with rank n.
- Number of perfect connected undirected simple graphs on n nodes.A052433
Number of perfect connected undirected simple graphs on n nodes.
- Nearest integer to R(n) - pi(n), where R(x) is the Riemann prime counting function.A052434
Nearest integer to R(n) - pi(n), where R(x) is the Riemann prime counting function.
- a(n) = round(li(n) - pi(n)), where li is the logarithmic integral and pi(x) is the number of primes <= x.A052435
a(n) = round(li(n) - pi(n)), where li is the logarithmic integral and pi(x) is the number of primes <= x.
- Number of canonical polygons of n sides.A052436
Number of canonical polygons of n sides.
- Number of simple unlabeled n-node graphs with 1 center node.A052437
Number of simple unlabeled n-node graphs with 1 center node.
- Number of simple unlabeled n-node graphs with 2 center nodes.A052438
Number of simple unlabeled n-node graphs with 2 center nodes.
- Number of simple unlabeled n-node graphs with 3 center nodes.A052439
Number of simple unlabeled n-node graphs with 3 center nodes.
- Number of simple unlabeled n-node graphs with 4 center nodes.A052440
Number of simple unlabeled n-node graphs with 4 center nodes.
- Number of simple unlabeled n-node graphs with 5 center nodes.A052441
Number of simple unlabeled n-node graphs with 5 center nodes.
- Number of simple unlabeled n-node graphs of connectivity 1.A052442
Number of simple unlabeled n-node graphs of connectivity 1.
- Number of simple unlabeled n-node graphs of connectivity 2.A052443
Number of simple unlabeled n-node graphs of connectivity 2.
- Number of simple unlabeled n-node graphs of connectivity 3.A052444
Number of simple unlabeled n-node graphs of connectivity 3.
- Number of simple unlabeled n-node graphs of connectivity 4.A052445
Number of simple unlabeled n-node graphs of connectivity 4.
- Number of unlabeled simple connected bridged graphs on n nodes.A052446
Number of unlabeled simple connected bridged graphs on n nodes.
- Number of simple unlabeled n-node graphs of edge-connectivity 2.A052447
Number of simple unlabeled n-node graphs of edge-connectivity 2.
- Number of simple unlabeled n-node graphs of edge-connectivity 3.A052448
Number of simple unlabeled n-node graphs of edge-connectivity 3.
- a(n) = 1 + Product_{k=1..n} Fibonacci(k).A052449
a(n) = 1 + Product_{k=1..n} Fibonacci(k).
- Number of n-node simple graphs having clique number 2.A052450
Number of n-node simple graphs having clique number 2.
- Number of n-node simple graphs having clique number 3.A052451
Number of n-node simple graphs having clique number 3.
- Number of n-node simple graphs having clique number 4.A052452
Number of n-node simple graphs having clique number 4.
- Number of nonisomorphic (3,n) cage graphs.A052453
Number of nonisomorphic (3,n) cage graphs.
- Positive integer values of k such that 10*k^2 - 9 is a square.A052454
Positive integer values of k such that 10*k^2 - 9 is a square.
- Fixed points for operation of repeatedly replacing a number with the sum of the fourth power of its digits.A052455
Fixed points for operation of repeatedly replacing a number with the sum of the fourth power of its digits.
- Number of magic series of order n.A052456
Number of magic series of order n.
- Number of bimagic series for squares of order n.A052457
Number of bimagic series for squares of order n.
- Number of trimagic series for squares of order n.A052458
Number of trimagic series for squares of order n.
- a(n) = n*(2*n^2 + 1)*(n^2 + 1)/6.A052459
a(n) = n*(2*n^2 + 1)*(n^2 + 1)/6.
- 3-magic series constant.A052460
3-magic series constant.