Sequences
392,541 sequences
- Number of compositions (ordered partitions) of n into 1's, 3's and 5's.A060961
Number of compositions (ordered partitions) of n into 1's, 3's and 5's.
- Expansion of (1+x^2)*(1+x^5)/( Product_{j=1..7} (1-x^j) ).A060962
Expansion of (1+x^2)*(1+x^5)/( Product_{j=1..7} (1-x^j) ).
- Number of pairings of the first 2n positive integers so that the absolute differences of each pair are different.A060963
Number of pairings of the first 2n positive integers so that the absolute differences of each pair are different.
- Table by antidiagonals where T(n,k) = n*T(n,k-1) - T(n,k-2) with T(n,0) = 2 and T(n,1) = n.A060964
Table by antidiagonals where T(n,k) = n*T(n,k-1) - T(n,k-2) with T(n,0) = 2 and T(n,1) = n.
- For p=prime(n), a(n) = number of points (x,y) on the elliptic curve x^3 + y^3 = 1 (mod p), including the point at infinity.A060965
For p=prime(n), a(n) = number of points (x,y) on the elliptic curve x^3 + y^3 = 1 (mod p), including the point at infinity.
- Number of nonisomorphic circulant oriented graphs (i.e., Cayley graphs for the cyclic group) of order n.A060966
Number of nonisomorphic circulant oriented graphs (i.e., Cayley graphs for the cyclic group) of order n.
- Number of squared primes <= 2^n.A060967
Number of squared primes <= 2^n.
- Number of solutions to x^2 + y^2 == 1 (mod n).A060968
Number of solutions to x^2 + y^2 == 1 (mod n).
- Number of cubes of primes <= 2^n.A060969
Number of cubes of primes <= 2^n.
- Number of fourth powers of primes <= 2^n.A060970
Number of fourth powers of primes <= 2^n.
- Number of fifth powers of primes <= 2^n.A060971
Number of fifth powers of primes <= 2^n.
- Triangle giving numbers of closed plane meanders.A060972
Triangle giving numbers of closed plane meanders.
- a(2*n+1) = a(n+1)+a(n), a(2*n) = 2*a(n), with a(1)=0 and a(2)=1.A060973
a(2*n+1) = a(n+1)+a(n), a(2*n) = 2*a(n), with a(1)=0 and a(2)=1.
- Irregular primes with irregularity > 1.A060974
Irregular primes with irregularity > 1.
- Irregular primes with irregularity index three.A060975
Irregular primes with irregularity index three.
- Odd nonprimes c which divide Bernoulli(2*c).A060976
Odd nonprimes c which divide Bernoulli(2*c).
- The nonprimes n!+2 ... n!+n are the a(n)-th string of n-1 prime-free consecutive terms, the first such one being the string of composite numbers A000230(k)+1 through A001632(k)-1 when n=2k, or through A001632(k)-2 when n=2k-1.A060977
The nonprimes n!+2 ... n!+n are the a(n)-th string of n-1 prime-free consecutive terms, the first such one being the string of composite numbers A000230(k)+1 through A001632(k)-1 when n=2k, or through A001632(k)-2 when n=2k-1.
- |First digit - second digit + third digit - fourth digit ...| = 10.A060978
|First digit - second digit + third digit - fourth digit ...| = 10.
- |First digit - second digit + third digit - fourth digit ...| = 11.A060979
|First digit - second digit + third digit - fourth digit ...| = 11.
- |First digit - second digit + third digit - fourth digit ...| = 12.A060980
|First digit - second digit + third digit - fourth digit ...| = 12.
- Primes of the form 4k^2 - 152k + 1487 + (6k - 114)*(-1)^k.A060981
Primes of the form 4k^2 - 152k + 1487 + (6k - 114)*(-1)^k.
- a(n) = Smallest nontrivial number k > 9 such that |first (leftmost) decimal digit of k - second digit + third digit - fourth digit ...| = n.A060982
a(n) = Smallest nontrivial number k > 9 such that |first (leftmost) decimal digit of k - second digit + third digit - fourth digit ...| = n.
- Number of primitive sublattices of index n in generic 3-dimensional lattice.A060983
Number of primitive sublattices of index n in generic 3-dimensional lattice.
- a(1) = 1; a(n+1) = a(n) + (largest square <= a(n)).A060984
a(1) = 1; a(n+1) = a(n) + (largest square <= a(n)).
- a(1) = 1; a(n+1) = a(n) + (largest triangular number <= a(n)).A060985
a(1) = 1; a(n+1) = a(n) + (largest triangular number <= a(n)).
- Erroneous version of A359742.A060986
Erroneous version of A359742.
- Erroneous version of A359743.A060987
Erroneous version of A359743.
- Erroneous version of A359744.A060988
Erroneous version of A359744.
- Number of nice error bases of degree n with a non-Abelian index group.A060989
Number of nice error bases of degree n with a non-Abelian index group.
- Number of solutions to x - d(x) = n, where d(n) is the number of divisors of n (A000005).A060990
Number of solutions to x - d(x) = n, where d(n) is the number of divisors of n (A000005).
- a(n) is the smallest positive integer c such that the equation A049820(x) = c has exactly n solutions.A060991
a(n) is the smallest positive integer c such that the equation A049820(x) = c has exactly n solutions.
- a(n) = Sum_{gcd(i,j) | 0 < i <= j < n and i+j = n}.A060992
a(n) = Sum_{gcd(i,j) | 0 < i <= j < n and i+j = n}.
- Radii of Integer Distance Skew Tetrahedra.A060993
Radii of Integer Distance Skew Tetrahedra.
- Duplicate of A031146.A060994
Duplicate of A031146.
- Number of routes of length 2n on the sides of an octagon from a point to opposite point.A060995
Number of routes of length 2n on the sides of an octagon from a point to opposite point.
- Stirling2 transform of [2,3,3,3,3,3,3,3,...].A060996
Stirling2 transform of [2,3,3,3,3,3,3,3,...].
- Decimal representation of continued fraction 1, 2, 3, 4, 5, 6, 7, ...A060997
Decimal representation of continued fraction 1, 2, 3, 4, 5, 6, 7, ...
- Squares of 1 and primes, written backwards.A060998
Squares of 1 and primes, written backwards.
- Nearest integer to (n+1)^3/9.A060999
Nearest integer to (n+1)^3/9.
- a(n) = Sum_{k=1..n} A060999(k) * k^3.A061000
a(n) = Sum_{k=1..n} A060999(k) * k^3.
- Partial sums of the squares of the terms of A060999.A061001
Partial sums of the squares of the terms of A060999.
- As p runs through the primes >= 5, sequence gives { numerator of Sum_{k=1..p-1} 1/k } / p^2.A061002
As p runs through the primes >= 5, sequence gives { numerator of Sum_{k=1..p-1} 1/k } / p^2.
- Nearest integer to n^5/25.A061003
Nearest integer to n^5/25.
- Nearest integer to n^6/36.A061004
Nearest integer to n^6/36.
- (Nearest integer to n^6/36) / 2.A061005
(Nearest integer to n^6/36) / 2.
- a(n) = (n-1)! mod n.A061006
a(n) = (n-1)! mod n.
- a(n) = -(n-1)! mod n.A061007
a(n) = -(n-1)! mod n.
- a(n) = Sum_{j=1..n} (-(n-1)! mod n).A061008
a(n) = Sum_{j=1..n} (-(n-1)! mod n).
- a(n) = -2 + Sum_{j=1..n} (-(n-1)!) mod n.A061009
a(n) = -2 + Sum_{j=1..n} (-(n-1)!) mod n.
- Number of digits in (10^n)!.A061010
Number of digits in (10^n)!.