Sequences
392,541 sequences
- Floor( p/log(p) ), where p = prime(n).A086861
Floor( p/log(p) ), where p = prime(n).
- Differences between successive palindromes.A086862
Differences between successive palindromes.
- a(n)=floor{square((1*n^0+1*n^1+2*n^2+4*n^3)/(1*n^0+2*n^1+1*n^2))}.A086863
a(n)=floor{square((1*n^0+1*n^1+2*n^2+4*n^3)/(1*n^0+2*n^1+1*n^2))}.
- a(n) = (n-1)*(n-2)*(n-3)*(3*n-10)*3^(n-5)/4.A086864
a(n) = (n-1)*(n-2)*(n-3)*(3*n-10)*3^(n-5)/4.
- Numbers n such that 2*10^n+11 is prime.A086865
Numbers n such that 2*10^n+11 is prime.
- Third column of A059450.A086866
Third column of A059450.
- a(n) = floor(abs(1/sin(n))).A086867
a(n) = floor(abs(1/sin(n))).
- a(n) = Floor(1/sin(A070752(n))).A086868
a(n) = Floor(1/sin(A070752(n))).
- a(n) = Floor(abs(1/sin(A070751(n)))).A086869
a(n) = Floor(abs(1/sin(A070751(n)))).
- Primes equal to a product of twin primes minus 1 divided by 2.A086870
Primes equal to a product of twin primes minus 1 divided by 2.
- Row sums of A059450.A086871
Row sums of A059450.
- Triangle T(n, k) read by rows; given by [1, 2, 3, 4, 5, 6, ..] DELTA [1, 4, 9, 16, 25, 36, ...] where DELTA is the operator defined in A084938.A086872
Triangle T(n, k) read by rows; given by [1, 2, 3, 4, 5, 6, ..] DELTA [1, 4, 9, 16, 25, 36, ...] where DELTA is the operator defined in A084938.
- Triangle read by rows in which row n >= 1 gives coefficients in expansion of the polynomial Sum_{k=1..n} (1/n)*binomial(n,k)*binomial(n,k-1)*x^(2k)*(1+x)^(2n-2k) / x^2 in powers of x.A086873
Triangle read by rows in which row n >= 1 gives coefficients in expansion of the polynomial Sum_{k=1..n} (1/n)*binomial(n,k)*binomial(n,k-1)*x^(2k)*(1+x)^(2n-2k) / x^2 in powers of x.
- Seventh power of odd primes.A086874
Seventh power of odd primes.
- Sum of rank(M) over all n X n matrices over Z with all entries zero or one.A086875
Sum of rank(M) over all n X n matrices over Z with all entries zero or one.
- Run lengths in A071542.A086876
Run lengths in A071542.
- Primes of the form (k+1)^k - k^k.A086877
Primes of the form (k+1)^k - k^k.
- Numbers n such that A003313(n) = A003313(2n).A086878
Numbers n such that A003313(n) = A003313(2n).
- Number of symmetric singular n X n matrices over GF(2).A086879
Number of symmetric singular n X n matrices over GF(2).
- a(n) = floor( sum(k=0, infinity, k^n/(k!)^2 ) ); related to generalized Bell numbers.A086880
a(n) = floor( sum(k=0, infinity, k^n/(k!)^2 ) ); related to generalized Bell numbers.
- a(n) = (2*n)!*Sum[Sum[1/(i+j),{i,1,n}],{j,1,n}].A086881
a(n) = (2*n)!*Sum[Sum[1/(i+j),{i,1,n}],{j,1,n}].
- a(n) is the period of the imaginary continued fraction expansion of sqrt(-n).A086882
a(n) is the period of the imaginary continued fraction expansion of sqrt(-n).
- Numbers n such that the decimal expansion of 1/n is nonterminating and contains arbitrarily long palindromic substrings.A086883
Numbers n such that the decimal expansion of 1/n is nonterminating and contains arbitrarily long palindromic substrings.
- Smallest string of 1's and 0's which is prime in every base from 2 to n.A086884
Smallest string of 1's and 0's which is prime in every base from 2 to n.
- Lower triangular matrix, read by rows: T(i,j) = number of ways i seats can be occupied by any number k (0<=k<=j<=i) of persons.A086885
Lower triangular matrix, read by rows: T(i,j) = number of ways i seats can be occupied by any number k (0<=k<=j<=i) of persons.
- Ljungstrand's sequence: number of distinct solutions to n = (X + 1/x)(Y + 1/y), where x,y > 1 and X,Y are integers.A086886
Ljungstrand's sequence: number of distinct solutions to n = (X + 1/x)(Y + 1/y), where x,y > 1 and X,Y are integers.
- a(n) = least semiprime with factors not previously used containing integers 2n and 2n+1 as substrings.A086887
a(n) = least semiprime with factors not previously used containing integers 2n and 2n+1 as substrings.
- a(n)=sqrt(s^2 - 4*p) where s=A086533(n), p=A086860(n).A086888
a(n)=sqrt(s^2 - 4*p) where s=A086533(n), p=A086860(n).
- Real part of Propp's cubic recurrence starting with i (i^2=-1).A086889
Real part of Propp's cubic recurrence starting with i (i^2=-1).
- Imaginary part of Propp's cubic recurrence starting with i (i^2=-1).A086890
Imaginary part of Propp's cubic recurrence starting with i (i^2=-1).
- Denominator of 4*(Integral_{x=0..1} (1-x^2)^((2n-1)/2) dx)/Pi.A086891
Denominator of 4*(Integral_{x=0..1} (1-x^2)^((2n-1)/2) dx)/Pi.
- Greatest common divisor of 2^n-1 and 3^n-1.A086892
Greatest common divisor of 2^n-1 and 3^n-1.
- a(n) is the index of F(n+1) at the unique occurrence of the ordered pair of reversed consecutive terms (F(n+1),F(n)) in Stern's diatomic sequence A002487, where F(k) denotes the k-th term of the Fibonacci sequence A000045.A086893
a(n) is the index of F(n+1) at the unique occurrence of the ordered pair of reversed consecutive terms (F(n+1),F(n)) in Stern's diatomic sequence A002487, where F(k) denotes the k-th term of the Fibonacci sequence A000045.
- a(n) = (A000522(2*n) + 1)/2.A086894
a(n) = (A000522(2*n) + 1)/2.
- a(n) = 1/3!*(A000522(3*n) + 3*A000522(n) + 2).A086895
a(n) = 1/3!*(A000522(3*n) + 3*A000522(n) + 2).
- a(n) = (1/4!)*(A000522(4*n) + 6*A000522(2*n) + 8*A000522(n) + 9).A086896
a(n) = (1/4!)*(A000522(4*n) + 6*A000522(2*n) + 8*A000522(n) + 9).
- a(n) = 1/5!*(A000522(5*n)+10*A000522(3*n)+20*A000522(2*n)+45*A000522(n)+44).A086897
a(n) = 1/5!*(A000522(5*n)+10*A000522(3*n)+20*A000522(2*n)+45*A000522(n)+44).
- a(n) = Sum_{d|n} tau(d-1).A086898
a(n) = Sum_{d|n} tau(d-1).
- Number of real n X n invertible symmetric (0,1) matrices.A086899
Number of real n X n invertible symmetric (0,1) matrices.
- Number of real n X n symmetric (0,1) matrices with positive determinant.A086900
Number of real n X n symmetric (0,1) matrices with positive determinant.
- a(1) = a(2) = 1; for n>2, a(n) = 4*a(n-1) + 3*a(n-2).A086901
a(1) = a(2) = 1; for n>2, a(n) = 4*a(n-1) + 3*a(n-2).
- a(n) = 7*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 7.A086902
a(n) = 7*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 7.
- a(n) = 8*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 8.A086903
a(n) = 8*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 8.
- Write the primes in binary; a(n) = total number of 0's in those which have an n-bit expansion.A086904
Write the primes in binary; a(n) = total number of 0's in those which have an n-bit expansion.
- a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(k,floor(k/2)).A086905
a(n) = Sum_{k=0..n} (-1)^(n-k)*binomial(k,floor(k/2)).
- Number of symmetric singular n X n (0,1) matrices over the reals.A086906
Number of symmetric singular n X n (0,1) matrices over the reals.
- Duplicate of A132186.A086907
Duplicate of A132186.
- Let R be the polynomial ring GF(2)[x]. Then a(n) = number of distinct products f*g with f,g in R and 0 <= deg(f),deg(g) <= n.A086908
Let R be the polynomial ring GF(2)[x]. Then a(n) = number of distinct products f*g with f,g in R and 0 <= deg(f),deg(g) <= n.
- Middle side of the first primitive d-arithmetic triangle, where d=A072330(n).A086909
Middle side of the first primitive d-arithmetic triangle, where d=A072330(n).
- a(1)=1; a(n) = 1 + abs(prime(n) - a(n-1)).A086910
a(1)=1; a(n) = 1 + abs(prime(n) - a(n-1)).