Sequences
392,541 sequences
- Circle numbers (version 1): a(n)= number of points (i,j), i,j integers, contained in a circle of diameter n, centered at the origin.A053411
Circle numbers (version 1): a(n)= number of points (i,j), i,j integers, contained in a circle of diameter n, centered at the origin.
- n-th nonzero Fibonacci numbers arising in A053408.A053412
n-th nonzero Fibonacci numbers arising in A053408.
- Primes of the form A003266(n) + 1.A053413
Primes of the form A003266(n) + 1.
- Circle numbers (version 2): a(n) is the number of points (i,j), i,j integers, contained in a circle of diameter n, centered at (0, 1/2).A053414
Circle numbers (version 2): a(n) is the number of points (i,j), i,j integers, contained in a circle of diameter n, centered at (0, 1/2).
- Circle numbers (version 3): a(n) = number of points (i,j), i,j integers, contained in a circle of diameter n, centered at (1/2, 1/2).A053415
Circle numbers (version 3): a(n) = number of points (i,j), i,j integers, contained in a circle of diameter n, centered at (1/2, 1/2).
- Circle numbers (version 4): a(n)= number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in a circle of diameter n, centered at (0,0).A053416
Circle numbers (version 4): a(n)= number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in a circle of diameter n, centered at (0,0).
- Circle numbers (version 5): a(n) = number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in a circle of diameter n, centered at (1/2,0).A053417
Circle numbers (version 5): a(n) = number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in a circle of diameter n, centered at (1/2,0).
- Number of unlabeled directed graphs with n arcs and no isolated vertices.A053418
Number of unlabeled directed graphs with n arcs and no isolated vertices.
- Number of graphs with loops (symmetric relations) with n edges.A053419
Number of graphs with loops (symmetric relations) with n edges.
- Number of 4-multigraphs on n nodes.A053420
Number of 4-multigraphs on n nodes.
- Number of 5-multigraphs on n nodes.A053421
Number of 5-multigraphs on n nodes.
- n times (n 1's): a(n) = n*(10^n - 1)/9.A053422
n times (n 1's): a(n) = n*(10^n - 1)/9.
- The mapping F(n) = floor(floor(n*sqrt(n)) / floor(sqrt(n))) iterates to a fixed point; a(n) is the least k such that f(k,n)=f(k-1,n), where f(0,n)=n, f(1,n)=F(n), f(k,n)=f(k-1,F(n)).A053423
The mapping F(n) = floor(floor(n*sqrt(n)) / floor(sqrt(n))) iterates to a fixed point; a(n) is the least k such that f(k,n)=f(k-1,n), where f(0,n)=n, f(1,n)=F(n), f(k,n)=f(k-1,F(n)).
- Fixed point to which iterates of F(n) in A053423 converge.A053424
Fixed point to which iterates of F(n) in A053423 converge.
- Even numbers k such that the 120 points of the 600-cell exactly integrate homogeneous polynomials of degree k.A053425
Even numbers k such that the 120 points of the 600-cell exactly integrate homogeneous polynomials of degree k.
- Pure 2-complexes on n nodes with at most 3 multiple 2-simplexes.A053426
Pure 2-complexes on n nodes with at most 3 multiple 2-simplexes.
- Numbers n such that Catalan(n)-1 is prime.A053427
Numbers n such that Catalan(n)-1 is prime.
- a(n) = a(n-1) + 20*a(n-2), n >= 2; a(0)=1, a(1)=1.A053428
a(n) = a(n-1) + 20*a(n-2), n >= 2; a(0)=1, a(1)=1.
- Numbers n such that Catalan(n)+1 is prime.A053429
Numbers n such that Catalan(n)+1 is prime.
- a(n) = (6^(n+1) - (-5)^(n+1))/11.A053430
a(n) = (6^(n+1) - (-5)^(n+1))/11.
- Numbers k such that (Pi/2)*k^2*sin(1/k) < floor(Pi*k/2).A053431
Numbers k such that (Pi/2)*k^2*sin(1/k) < floor(Pi*k/2).
- Numbers with digits in alphabetical order (in English).A053432
Numbers with digits in alphabetical order (in English).
- Numbers with distinct digits in alphabetical order (in English).A053433
Numbers with distinct digits in alphabetical order (in English).
- Primes with digits in alphabetical order (in English).A053434
Primes with digits in alphabetical order (in English).
- Primes with distinct digits in alphabetical order (in English).A053435
Primes with distinct digits in alphabetical order (in English).
- a(n) = n+1 + ceiling(n/2)*(ceiling(n/2)-1)*(ceiling(n/2)+1)/6.A053436
a(n) = n+1 + ceiling(n/2)*(ceiling(n/2)-1)*(ceiling(n/2)+1)/6.
- Number of least favorable parameter configurations.A053437
Number of least favorable parameter configurations.
- Expansion of (1+x+2*x^3)/((1-x)*(1-x^2)).A053438
Expansion of (1+x+2*x^3)/((1-x)*(1-x^2)).
- Expansion of (1+x+2*x^3)/((1-x)*(1-x^2)^2).A053439
Expansion of (1+x+2*x^3)/((1-x)*(1-x^2)^2).
- Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n,k) is the number of ascending chains of length k+1 of nonempty subsets of the set {1, 2, ..., n+1}.A053440
Number of k-simplices in the first derived complex of the standard triangulation of an n-simplex. Equivalently, T(n,k) is the number of ascending chains of length k+1 of nonempty subsets of the set {1, 2, ..., n+1}.
- Moments of generalized Motzkin paths.A053441
Moments of generalized Motzkin paths.
- Moments of generalized Motzkin paths.A053442
Moments of generalized Motzkin paths.
- x^2 + y^2 does not take on all possible values mod n.A053443
x^2 + y^2 does not take on all possible values mod n.
- x^2 + y^2 mod A053443(n) does not take on value a(n).A053444
x^2 + y^2 mod A053443(n) does not take on value a(n).
- Second differences of partition numbers A000041.A053445
Second differences of partition numbers A000041.
- Multiplicative order of 3 mod m, where gcd(m, 3) = 1.A053446
Multiplicative order of 3 mod m, where gcd(m, 3) = 1.
- Multiplicative order of 4 mod 2n+1.A053447
Multiplicative order of 4 mod 2n+1.
- Multiplicative order of 5 mod m, where gcd(m, 5) = 1.A053448
Multiplicative order of 5 mod m, where gcd(m, 5) = 1.
- Multiplicative order of 6 mod n, where gcd(n, 6) = 1.A053449
Multiplicative order of 6 mod n, where gcd(n, 6) = 1.
- Multiplicative order of 7 mod n, where gcd(n,7) = 1.A053450
Multiplicative order of 7 mod n, where gcd(n,7) = 1.
- Multiplicative order of 8 mod 2n+1.A053451
Multiplicative order of 8 mod 2n+1.
- Multiplicative order of 9 mod n, where gcd(n, 9) = 1.A053452
Multiplicative order of 9 mod n, where gcd(n, 9) = 1.
- Duplicate of A002329.A053453
Duplicate of A002329.
- Number of weakly connected digraphs with n arcs.A053454
Number of weakly connected digraphs with n arcs.
- a(n) = ((8^n) - (-6)^n)/14.A053455
a(n) = ((8^n) - (-6)^n)/14.
- Open disk numbers (version 1): a(n) is the number of points (i,j), i,j, integers, contained in an open disk of diameter n, centered at (0,0).A053456
Open disk numbers (version 1): a(n) is the number of points (i,j), i,j, integers, contained in an open disk of diameter n, centered at (0,0).
- Open disk numbers (version 2): a(n) is the number of points (i,j), i,j, integers, contained in an open disk of diameter n, centered at (0,1/2).A053457
Open disk numbers (version 2): a(n) is the number of points (i,j), i,j, integers, contained in an open disk of diameter n, centered at (0,1/2).
- Open disk numbers (version 3): a(n) is the number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in an open disk of diameter n, centered at (0,0).A053458
Open disk numbers (version 3): a(n) is the number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in an open disk of diameter n, centered at (0,0).
- Open disk numbers (version 4): a(n) is the number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in an open disk of diameter n, centered at (1/2,0).A053459
Open disk numbers (version 4): a(n) is the number of points (i+j/2,j*sqrt(3)/2), i,j integers (triangular grid) contained in an open disk of diameter n, centered at (1/2,0).
- The 120 points of the 600-cell exactly integrate homogeneous polynomials of degree n.A053460
The 120 points of the 600-cell exactly integrate homogeneous polynomials of degree n.