Sequences
392,541 sequences
- a(n) = S1(n,4), where S1(n,t) = Sum_{k=0..n} k^t * Sum_{j=0..k} binomial(n,j).A089661
a(n) = S1(n,4), where S1(n,t) = Sum_{k=0..n} k^t * Sum_{j=0..k} binomial(n,j).
- a(n) = S1(n,5), where S1(n,t) = Sum_{k=0..n} k^t * Sum_{j=0..k} binomial(n,j).A089662
a(n) = S1(n,5), where S1(n,t) = Sum_{k=0..n} k^t * Sum_{j=0..k} binomial(n,j).
- a(n) = S1(n, 6), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).A089663
a(n) = S1(n, 6), where S1(n, t) = Sum_{k=0..n} (k^t * Sum_{j=0..k} binomial(n,j)).
- a(n) = S2(n,1), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.A089664
a(n) = S2(n,1), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.
- a(n) = S2(n,2), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.A089665
a(n) = S2(n,2), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.
- a(n) = S2(n,3), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.A089666
a(n) = S2(n,3), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.
- a(n) = S2(n,4), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.A089667
a(n) = S2(n,4), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.
- a(n) = S2(n,5), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.A089668
a(n) = S2(n,5), where S2(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^2.
- a(n) = S3(n,1), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.A089669
a(n) = S3(n,1), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.
- a(n) = S3(n,2), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.A089670
a(n) = S3(n,2), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.
- a(n) = S3(n,3), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.A089671
a(n) = S3(n,3), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.
- a(n) = S3(n,4), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.A089672
a(n) = S3(n,4), where S3(n, t) = Sum_{k=0..n} k^t *(Sum_{j=0..k} binomial(n,j))^3.
- a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal and the main antidiagonal, are all distinct.A089673
a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal and the main antidiagonal, are all distinct.
- a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal read in the upward direction and the main antidiagonal, are all distinct.A089674
a(n) = number of n X n (0,1) matrices A such that the 2n+2 vectors consisting of the rows and the columns of the matrix A, as well as the main diagonal read in the upward direction and the main antidiagonal, are all distinct.
- Numbers k such that 10^k - 3 is prime.A089675
Numbers k such that 10^k - 3 is prime.
- a(n) is the maximal size of a set S of points in {0,1}^n in real n-dimensional Euclidean space such that every angle determined by three points in S is acute.A089676
a(n) is the maximal size of a set S of points in {0,1}^n in real n-dimensional Euclidean space such that every angle determined by three points in S is acute.
- Exponential convolution of A000670(n), with A000670(0)=0, with the sequence of all ones alternating in sign.A089677
Exponential convolution of A000670(n), with A000670(0)=0, with the sequence of all ones alternating in sign.
- Numbers n such that n^n + n! + n^2 + 1 is prime.A089678
Numbers n such that n^n + n! + n^2 + 1 is prime.
- Let g[n_]=Floor[(Prime[n]-n)/(n-PrimePi[n])]. Then a(n) = (g[n]+g[n+1])-g[n*(n+1)]+1.A089679
Let g[n_]=Floor[(Prime[n]-n)/(n-PrimePi[n])]. Then a(n) = (g[n]+g[n+1])-g[n*(n+1)]+1.
- Let g[n_]=(Prime[n]-n)/(n-PrimePi[n]). Then a(n) = Floor[Exp[((g[n]+g[n+1])-g[n*(n+1)]+1)/1.5]].A089680
Let g[n_]=(Prime[n]-n)/(n-PrimePi[n]). Then a(n) = Floor[Exp[((g[n]+g[n+1])-g[n*(n+1)]+1)/1.5]].
- Numbers n such that 3n^2 - 1 is prime.A089681
Numbers n such that 3n^2 - 1 is prime.
- Primes of the form 3*m^2 - 1.A089682
Primes of the form 3*m^2 - 1.
- a(n) = 3^(4*n).A089683
a(n) = 3^(4*n).
- Numbers k such that 2*phi(k) > k.A089684
Numbers k such that 2*phi(k) > k.
- a={1,3,7,9} p[n]=Prime[n]*10+a[[1+Mod[n,4]]] a(m) = if p[n] is prime, then p[n].A089685
a={1,3,7,9} p[n]=Prime[n]*10+a[[1+Mod[n,4]]] a(m) = if p[n] is prime, then p[n].
- a={1,3,7,9} b[n]=Prime[n]*10+a[[4-Mod[n,4]]] c(m) =if b[n] is prime then b[n].A089686
a={1,3,7,9} b[n]=Prime[n]*10+a[[4-Mod[n,4]]] c(m) =if b[n] is prime then b[n].
- Linear chaotic function based on log function from primes and prime distribution.A089687
Linear chaotic function based on log function from primes and prime distribution.
- Table T(n,k), n>=0 and k>=1, read by antidiagonals; the k-th row is defined by : partitions of k*n into powers of k (with T(0,k) = 1).A089688
Table T(n,k), n>=0 and k>=1, read by antidiagonals; the k-th row is defined by : partitions of k*n into powers of k (with T(0,k) = 1).
- A nonsense sequence.A089689
A nonsense sequence.
- a={1,3,7,9} a1={1,3,7,9,0} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[n,5]]],{m,0,n}]+a,{n,0,digits}]]; a[m]=if b[n] is prime then b[n].A089690
a={1,3,7,9} a1={1,3,7,9,0} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[n,5]]],{m,0,n}]+a,{n,0,digits}]]; a[m]=if b[n] is prime then b[n].
- a={1,3,7,9} a1={1,3,7,9,0} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[m,5]]],{m,0,n}]+a,{n,0,digits}]]; a(m) = if b[n] is prime then b[n].A089691
a={1,3,7,9} a1={1,3,7,9,0} b[n]=Flatten[Table[10*Sum[10^m*a1[[1+Mod[m,5]]],{m,0,n}]+a,{n,0,digits}]]; a(m) = if b[n] is prime then b[n].
- a(n) = phi(2n)/2^omega(n).A089692
a(n) = phi(2n)/2^omega(n).
- Numbers n such that phi(n) = 2^bigomega(n).A089693
Numbers n such that phi(n) = 2^bigomega(n).
- Number of palindromes < 10^n in A088753.A089694
Number of palindromes < 10^n in A088753.
- Numbers m such that placing as many possible '+' signs anywhere in between the digits yields a prime in every case. Let abcd... be the digits of m; then abcd, a + bcd, ab + cd, abc + d, a + b + cd, a + bc + d, ab + c + d, a + b + c + d, ... are all prime.A089695
Numbers m such that placing as many possible '+' signs anywhere in between the digits yields a prime in every case. Let abcd... be the digits of m; then abcd, a + bcd, ab + cd, abc + d, a + b + cd, a + bc + d, ab + c + d, a + b + c + d, ... are all prime.
- Numbers k such that the numbers obtained by placing as many '*' signs as possible anywhere between the digits and then adding 1 yields a prime in every case: let abc.. be the digits of k, then abc+1, a*bc+1, ab*c+1, a*b*c+1, ... must all be primes.A089696
Numbers k such that the numbers obtained by placing as many '*' signs as possible anywhere between the digits and then adding 1 yields a prime in every case: let abc.. be the digits of k, then abc+1, a*bc+1, ab*c+1, a*b*c+1, ... must all be primes.
- Smallest n-digit number k such that k+1 as well as 1 + the product of digits of k are squares greater than 1.A089697
Smallest n-digit number k such that k+1 as well as 1 + the product of digits of k are squares greater than 1.
- Largest n-digit number k such that k+1 as well as 1 + the product of digits of k are squares greater than 1.A089698
Largest n-digit number k such that k+1 as well as 1 + the product of digits of k are squares greater than 1.
- Numbers n with property that n + 1 as well as the (product of digits of n) + 1 are primes.A089699
Numbers n with property that n + 1 as well as the (product of digits of n) + 1 are primes.
- Smallest n-digit member of A089699.A089700
Smallest n-digit member of A089699.
- Largest n-digit member of A089699.A089701
Largest n-digit member of A089699.
- a(1) = 2 then primes in nondecreasing order such that every concatenation is prime.A089702
a(1) = 2 then primes in nondecreasing order such that every concatenation is prime.
- Primes arising in A089702.A089703
Primes arising in A089702.
- Primes in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).A089704
Primes in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).
- Smallest n-digit prime in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).A089705
Smallest n-digit prime in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).
- Largest n-digit prime in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).A089706
Largest n-digit prime in which the unit place digit is 1 and the k-th most significant digit is prime (2,3,5,7) if k is prime else is composite (4,6,8,9,0).
- Smallest number beginning with 1 and having exactly n divisors.A089707
Smallest number beginning with 1 and having exactly n divisors.
- a(1) = 1, a(2) = 2, a(n) = a(n-1) + d where d is the sum of the absolute differences between all pairs of previous terms.A089708
a(1) = 1, a(2) = 2, a(n) = a(n-1) + d where d is the sum of the absolute differences between all pairs of previous terms.
- a(1) = 1, a(2) = 2; for n>2, a(n) = sum_{r=1..n} {sum of all previous terms taken r at a time}.A089709
a(1) = 1, a(2) = 2; for n>2, a(n) = sum_{r=1..n} {sum of all previous terms taken r at a time}.
- a(1) = 3. For n > 1, a(n) is the least unused number such that the concatenation a(n)a(n-1)...a(2)a(1) is prime.A089710
a(1) = 3. For n > 1, a(n) is the least unused number such that the concatenation a(n)a(n-1)...a(2)a(1) is prime.