Sequences
392,541 sequences
- Number of n X n matrices over an alphabet of size 13.A076811
Number of n X n matrices over an alphabet of size 13.
- a(n) = the smallest prime p such that p-prime(n)*4 is prime.A076812
a(n) = the smallest prime p such that p-prime(n)*4 is prime.
- Decimal expansion of Sum_{k>=1} zeta(2k)/k! = 2.40744...A076813
Decimal expansion of Sum_{k>=1} zeta(2k)/k! = 2.40744...
- Integer averages of five successive primes squared, (prime(n)^2+prime(n+1)^2+prime(n+2)^2+prime(n+3)^2+prime(n+4)^2)/5, for some n.A076814
Integer averages of five successive primes squared, (prime(n)^2+prime(n+1)^2+prime(n+2)^2+prime(n+3)^2+prime(n+4)^2)/5, for some n.
- Initial indices of five successive primes squared with integer average.A076815
Initial indices of five successive primes squared with integer average.
- Squares modulo triangular numbers: n^2 minus the greatest triangular number smaller than or equal to n^2.A076816
Squares modulo triangular numbers: n^2 minus the greatest triangular number smaller than or equal to n^2.
- Let u(1)=u(2)=1, u(n)=(3^floor(u(n-1)/2)+1)/u(n-2); then a(n)=10*u(n).A076817
Let u(1)=u(2)=1, u(n)=(3^floor(u(n-1)/2)+1)/u(n-2); then a(n)=10*u(n).
- Lexicographically earliest sequence of pairwise coprime tetrahedral numbers.A076818
Lexicographically earliest sequence of pairwise coprime tetrahedral numbers.
- Least position m > n in the decimal expansion of Pi=3.1415... such that the sum of all digits at positions < n is not greater than the sum of all digits at positions > n and <= m.A076819
Least position m > n in the decimal expansion of Pi=3.1415... such that the sum of all digits at positions < n is not greater than the sum of all digits at positions > n and <= m.
- Second-largest distinct prime dividing n (or 1 if n is a power of a prime).A076820
Second-largest distinct prime dividing n (or 1 if n is a power of a prime).
- Squares of the differences between consecutive primes.A076821
Squares of the differences between consecutive primes.
- Number of partitions of the n-th triangular number involving only the numbers 1..n and with exactly n terms.A076822
Number of partitions of the n-th triangular number involving only the numbers 1..n and with exactly n terms.
- Array of coefficients of 1/det(M_n)*P(M_n) where P(M_n) is the characteristic polynomial of the n-th n X n Hilbert matrix M_n(i,j)=1/(i+j-1).A076823
Array of coefficients of 1/det(M_n)*P(M_n) where P(M_n) is the characteristic polynomial of the n-th n X n Hilbert matrix M_n(i,j)=1/(i+j-1).
- Let a(1)=a(2)=1, a(n)=(2^ceiling(a(n-1)/2)+1)/a(n-2).A076824
Let a(1)=a(2)=1, a(n)=(2^ceiling(a(n-1)/2)+1)/a(n-2).
- Let u(1)=1, u(n)=2^u(n-1) (mod n), sequence gives values of n such that u(n)=1.A076825
Let u(1)=1, u(n)=2^u(n-1) (mod n), sequence gives values of n such that u(n)=1.
- a(n) = 2*(Sum_{k=0..n} A010060(k)) - n, where A010060 is a Thue-Morse sequence.A076826
a(n) = 2*(Sum_{k=0..n} A010060(k)) - n, where A010060 is a Thue-Morse sequence.
- Number of odd terms minus number of even terms in the set S(n) = ( A002977(k) : k<=n).A076827
Number of odd terms minus number of even terms in the set S(n) = ( A002977(k) : k<=n).
- Record high values in A078142.A076828
Record high values in A078142.
- a(n) = floor(log(log(n^n^n))).A076829
a(n) = floor(log(log(n^n^n))).
- Least square s such that A078142(s) is equal to the n-th prime.A076830
Least square s such that A078142(s) is equal to the n-th prime.
- Triangle T(n,k) read by rows giving number of inequivalent binary linear [n,k] codes (n >= 0, 0 <= k <= n).A076831
Triangle T(n,k) read by rows giving number of inequivalent binary linear [n,k] codes (n >= 0, 0 <= k <= n).
- Triangle T(n,k), read by rows, giving the total number of inequivalent binary linear [n,i] codes with no column of zeros, summed for i <= k (n >= 1, 1 <= k <= n).A076832
Triangle T(n,k), read by rows, giving the total number of inequivalent binary linear [n,i] codes with no column of zeros, summed for i <= k (n >= 1, 1 <= k <= n).
- Triangle T(n,k) read by rows giving number of inequivalent projective binary linear [n,k] codes (n >= 1, 1 <= k <= n).A076833
Triangle T(n,k) read by rows giving number of inequivalent projective binary linear [n,k] codes (n >= 1, 1 <= k <= n).
- Number of inequivalent projective binary linear [n,k] codes of any dimension k <= n. Also the number of simple binary matroids on n points.A076834
Number of inequivalent projective binary linear [n,k] codes of any dimension k <= n. Also the number of simple binary matroids on n points.
- Coefficients in expansion of Eisenstein series -q*E'_2.A076835
Coefficients in expansion of Eisenstein series -q*E'_2.
- Number of inequivalent indecomposable binary linear [n,k] codes with no column of zeros of any dimension k <= n.A076836
Number of inequivalent indecomposable binary linear [n,k] codes with no column of zeros of any dimension k <= n.
- Triangle T(n,k) read by rows giving number of inequivalent projective indecomposable binary linear [n,k] codes (n >= 1, 1 <= k <= n).A076837
Triangle T(n,k) read by rows giving number of inequivalent projective indecomposable binary linear [n,k] codes (n >= 1, 1 <= k <= n).
- Number of inequivalent indecomposable projective binary linear [n,k] codes of any dimension k <= n.A076838
Number of inequivalent indecomposable projective binary linear [n,k] codes of any dimension k <= n.
- A simple example of the Lyness 5-cycle: a(1) = a(2) = 1; a(n) = (a(n-1)+1)/a(n-2) (for n>2).A076839
A simple example of the Lyness 5-cycle: a(1) = a(2) = 1; a(n) = (a(n-1)+1)/a(n-2) (for n>2).
- a(1) = a(2) = 1; a(n) = (a(n-1) + 1)/a(n-2) (for n>2, n odd), (a(n-1)^2 + 1)/a(n-2) (for n>2, n even).A076840
a(1) = a(2) = 1; a(n) = (a(n-1) + 1)/a(n-2) (for n>2, n odd), (a(n-1)^2 + 1)/a(n-2) (for n>2, n even).
- a(1) = a(2) = 1; a(n) = (a(n-1)+1)/a(n-2) (for n>2, n odd), (a(n-1)^3+1)/a(n-2) (for n>2, n even).A076841
a(1) = a(2) = 1; a(n) = (a(n-1)+1)/a(n-2) (for n>2, n odd), (a(n-1)^3+1)/a(n-2) (for n>2, n even).
- Numerators of sequence of fractions defined by a(1) = a(2) = 1; for n > 2, a(n) = (a(n-1)+a(n-2)+1)/a(n-2).A076842
Numerators of sequence of fractions defined by a(1) = a(2) = 1; for n > 2, a(n) = (a(n-1)+a(n-2)+1)/a(n-2).
- Denominators of sequence of fractions defined by a(1) = a(2) = 1; for n > 2, a(n) = (a(n-1)+a(n-2)+1)/a(n-2).A076843
Denominators of sequence of fractions defined by a(1) = a(2) = 1; for n > 2, a(n) = (a(n-1)+a(n-2)+1)/a(n-2).
- a(1) = a(2) = a(3) = 1; a(n) = (a(n-1) + a(n-2) + 1)/a(n-3) (for n>3).A076844
a(1) = a(2) = a(3) = 1; a(n) = (a(n-1) + a(n-2) + 1)/a(n-3) (for n>3).
- Least k>0 such that n^k + n - 1 is prime.A076845
Least k>0 such that n^k + n - 1 is prime.
- Primes of the form n^k + n - 1, where k>0 is minimal.A076846
Primes of the form n^k + n - 1, where k>0 is minimal.
- Ramanujan function tau(p) as p runs through the primes.A076847
Ramanujan function tau(p) as p runs through the primes.
- Smallest prime factor of googol + n that exceeds 13, or 1 if googol + n is 13-smooth.A076848
Smallest prime factor of googol + n that exceeds 13, or 1 if googol + n is 13-smooth.
- Let u(1)=1, u(n) = n + abs(u(ceiling(n/2)) - u(floor(n/2))); then a(n) = u(n) - n.A076849
Let u(1)=1, u(n) = n + abs(u(ceiling(n/2)) - u(floor(n/2))); then a(n) = u(n) - n.
- Numbers k such that (10^k + 2)/6 is prime.A076850
Numbers k such that (10^k + 2)/6 is prime.
- Number of geometries for group A_n under axioms A.A076851
Number of geometries for group A_n under axioms A.
- Number of geometries for group A_n under axioms A, 2T_1.A076852
Number of geometries for group A_n under axioms A, 2T_1.
- Number of geometries for group A_n under axioms A, CD.A076853
Number of geometries for group A_n under axioms A, CD.
- Number of geometries for group A_n under axioms A, NT.A076854
Number of geometries for group A_n under axioms A, NT.
- Number of geometries for group A_n under axioms A, 2T_1, CD.A076855
Number of geometries for group A_n under axioms A, 2T_1, CD.
- Number of geometries for group A_n under axioms A, 2T_1, CD, NT.A076856
Number of geometries for group A_n under axioms A, 2T_1, CD, NT.
- Number of geometries for group S_n under axioms A.A076857
Number of geometries for group S_n under axioms A.
- Number of geometries for group S_n under axioms A, 2T_1.A076858
Number of geometries for group S_n under axioms A, 2T_1.
- Number of geometries for group S_n under axioms A, CD.A076859
Number of geometries for group S_n under axioms A, CD.
- Number of geometries for group S_n under axioms A, NT.A076860
Number of geometries for group S_n under axioms A, NT.