Sequences
392,541 sequences
- Erroneous version of A006794.A055511
Erroneous version of A006794.
- Lattices with n labeled elements.A055512
Lattices with n labeled elements.
- Class number h = h- * h+ of cyclotomic field Q( exp(2 Pi / prime(n)) ).A055513
Class number h = h- * h+ of cyclotomic field Q( exp(2 Pi / prime(n)) ).
- Composite numbers that are the sum of consecutive prime numbers and are divisible by the first and last of these primes.A055514
Composite numbers that are the sum of consecutive prime numbers and are divisible by the first and last of these primes.
- a(n) = (2^n - 1)/product(2^p - 1) where the product is over all distinct primes p that divide n.A055515
a(n) = (2^n - 1)/product(2^p - 1) where the product is over all distinct primes p that divide n.
- Largest integer k such that k | Phi(k) + d(k) + n.A055516
Largest integer k such that k | Phi(k) + d(k) + n.
- Largest integer k such that k | Phi(k) - d(k) + n, or 0 if no such k exists, where d() is the number of divisors.A055517
Largest integer k such that k | Phi(k) - d(k) + n, or 0 if no such k exists, where d() is the number of divisors.
- a_{k+1} = 6*a_k + 11*a_{k-1} - 19*a_{k-2} - 4*a_{k-3} + a_{k-4}, a_1=1, a_2=2, a_3=19, a_4=118, a_5=875.A055518
a_{k+1} = 6*a_k + 11*a_{k-1} - 19*a_{k-2} - 4*a_{k-3} + a_{k-4}, a_1=1, a_2=2, a_3=19, a_4=118, a_5=875.
- a(n) = 9*a(n-1) + 33*a(n-2) - 76*a(n-3) - 33*a(n-4) + 9*a(n-5) + a(n-6), a(0)=a(1)=1, a(2)=2, a(3)=35, a(4)=312, a(5)=3779.A055519
a(n) = 9*a(n-1) + 33*a(n-2) - 76*a(n-3) - 33*a(n-4) + 9*a(n-5) + a(n-6), a(0)=a(1)=1, a(2)=2, a(3)=35, a(4)=312, a(5)=3779.
- Numbers k such that 30*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A055520
Numbers k such that 30*R_k + 1 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Restricted left truncatable (Henry VIII) primes.A055521
Restricted left truncatable (Henry VIII) primes.
- Largest area of a Pythagorean triangle with n as length of one of the three sides (in fact as a leg).A055522
Largest area of a Pythagorean triangle with n as length of one of the three sides (in fact as a leg).
- Longest other leg of a Pythagorean triangle with n as length of a leg.A055523
Longest other leg of a Pythagorean triangle with n as length of a leg.
- Longest other side of a Pythagorean triangle with n as length of one of the three sides (in fact n is a leg and a(n) the hypotenuse).A055524
Longest other side of a Pythagorean triangle with n as length of one of the three sides (in fact n is a leg and a(n) the hypotenuse).
- Shortest other side of a Pythagorean triangle having n as length of one of the three sides.A055525
Shortest other side of a Pythagorean triangle having n as length of one of the three sides.
- Shortest hypotenuse of a Pythagorean triangle with n as length of a leg.A055526
Shortest hypotenuse of a Pythagorean triangle with n as length of a leg.
- Shortest other leg of a Pythagorean triangle with n as length of a leg.A055527
Shortest other leg of a Pythagorean triangle with n as length of a leg.
- a(n) = 10*a(n-1)+n^3, a(0)=0.A055528
a(n) = 10*a(n-1)+n^3, a(0)=0.
- Number of bits needed in mantissa to express n! exactly.A055529
Number of bits needed in mantissa to express n! exactly.
- The recurrence b(k) = 10*b(k-1) + k^n with b(0)=0 has b(k)/10^k converging to a(n)/9^(n+1).A055530
The recurrence b(k) = 10*b(k-1) + k^n with b(0)=0 has b(k)/10^k converging to a(n)/9^(n+1).
- Number of labeled order relations on n nodes in which longest chain has 2 nodes.A055531
Number of labeled order relations on n nodes in which longest chain has 2 nodes.
- Number of labeled order relations on n nodes in which longest chain has 3 nodes.A055532
Number of labeled order relations on n nodes in which longest chain has 3 nodes.
- Number of labeled order relations on n nodes in which longest chain has n-1 nodes.A055533
Number of labeled order relations on n nodes in which longest chain has n-1 nodes.
- Number of labeled order relations on n nodes in which longest chain has n-2 nodes.A055534
Number of labeled order relations on n nodes in which longest chain has n-2 nodes.
- Denominators in expansion of (1-x)^(-1/x)/e.A055535
Denominators in expansion of (1-x)^(-1/x)/e.
- Number of asymmetric types of (3,n)-hypergraphs under action of symmetric group S_3.A055536
Number of asymmetric types of (3,n)-hypergraphs under action of symmetric group S_3.
- Number of asymmetric types of (4,n)-hypergraphs under action of symmetric group S_4.A055537
Number of asymmetric types of (4,n)-hypergraphs under action of symmetric group S_4.
- Number of asymmetric types of (3,n)-hypergraphs without isolated nodes, under action of symmetric group S_3; asymmetric n-covers of an unlabeled 3-set.A055538
Number of asymmetric types of (3,n)-hypergraphs without isolated nodes, under action of symmetric group S_3; asymmetric n-covers of an unlabeled 3-set.
- Number of asymmetric types of (4,n)-hypergraphs without isolated nodes, under action of symmetric group S_4; asymmetric n-covers of an unlabeled 4-set.A055539
Number of asymmetric types of (4,n)-hypergraphs without isolated nodes, under action of symmetric group S_4; asymmetric n-covers of an unlabeled 4-set.
- Total number of leaves (nodes of vertex degree 1) in all graphs of n nodes.A055540
Total number of leaves (nodes of vertex degree 1) in all graphs of n nodes.
- Total number of leaves (nodes of vertex degree 1) in all labeled trees with n nodes.A055541
Total number of leaves (nodes of vertex degree 1) in all labeled trees with n nodes.
- Total number of nodes in all simple graphs of n nodes.A055542
Total number of nodes in all simple graphs of n nodes.
- Total number of nodes in all trees with n nodes.A055543
Total number of nodes in all trees with n nodes.
- Total number of nodes in all rooted trees with n nodes.A055544
Total number of nodes in all rooted trees with n nodes.
- Number of unlabeled matroids on n points.A055545
Number of unlabeled matroids on n points.
- a(n) = (-1)^(n+1) * 2^n * n!^2.A055546
a(n) = (-1)^(n+1) * 2^n * n!^2.
- Number of normal n X n matrices with entries {0,1}.A055547
Number of normal n X n matrices with entries {0,1}.
- Number of normal n X n (-1,1)-matrices.A055548
Number of normal n X n (-1,1)-matrices.
- Number of normal n X n (-1,0,1)-matrices.A055549
Number of normal n X n (-1,0,1)-matrices.
- Number of Poulet numbers (or pseudoprimes to base 2, A001567) less than 10^n.A055550
Number of Poulet numbers (or pseudoprimes to base 2, A001567) less than 10^n.
- Number of base-2 Euler-Jacobi pseudoprimes (A047713) less than 10^n.A055551
Number of base-2 Euler-Jacobi pseudoprimes (A047713) less than 10^n.
- Number of base-2 strong pseudoprimes (A001262) less than 10^n.A055552
Number of base-2 strong pseudoprimes (A001262) less than 10^n.
- Number of Carmichael numbers (A002997) less than 10^n.A055553
Number of Carmichael numbers (A002997) less than 10^n.
- An arithmetic progression each term of which is followed by at least 4 nonsquarefree consecutive integers.A055554
An arithmetic progression each term of which is followed by at least 4 nonsquarefree consecutive integers.
- a(n) = n!*(n!+1)/2.A055555
a(n) = n!*(n!+1)/2.
- Differences of arithmetic progressions of which the terms give chains of n consecutive nonsquarefree numbers if started with terms of A045882(n) or A051681(n).A055556
Differences of arithmetic progressions of which the terms give chains of n consecutive nonsquarefree numbers if started with terms of A045882(n) or A051681(n).
- Numbers k such that 3*R_k - 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k.A055557
Numbers k such that 3*R_k - 2 is prime, where R_k = 11...1 is the repunit (A002275) of length k.
- Primes of the form 1999...999.A055558
Primes of the form 1999...999.
- Primes of the form 2999...999.A055559
Primes of the form 2999...999.
- Base numbers of 9-gonal palindromic numbers.A055560
Base numbers of 9-gonal palindromic numbers.