Sequences
392,541 sequences
- 10*n^n+(n-1).A089211
10*n^n+(n-1).
- Primes p such that p-1 and p+1 are divisible by a fifth power.A089212
Primes p such that p-1 and p+1 are divisible by a fifth power.
- Primes p such that either 3^p-2 or 3^p+2 is prime or both are.A089213
Primes p such that either 3^p-2 or 3^p+2 is prime or both are.
- Let u(1)=0, u(2)=1; for k>2, u(k)= A010060(k)*u(k-1) + u(k-2) (mod 2); then a(n)=4n-b(n) where sequence (b(k)) gives values such that u(b(k))=0.A089214
Let u(1)=0, u(2)=1; for k>2, u(k)= A010060(k)*u(k-1) + u(k-2) (mod 2); then a(n)=4n-b(n) where sequence (b(k)) gives values such that u(b(k))=0.
- Thue-Morse sequence on the integers.A089215
Thue-Morse sequence on the integers.
- Number of triples (x,y,z) of integers such that 0 <= x <= y < n, 0 <= z < n, n^2 = x^2 + y^2 - z^2.A089216
Number of triples (x,y,z) of integers such that 0 <= x <= y < n, 0 <= z < n, n^2 = x^2 + y^2 - z^2.
- n-2 is a prime of the form 4*k+3.A089217
n-2 is a prime of the form 4*k+3.
- Erroneous version of A052195.A089218
Erroneous version of A052195.
- Numbers of the form (p0^x)(p1^(x+1))(p2^(x+2))...(pk^(x+k)), where x and k are positive integers and p0,p1,...,pk are primes with p0<p1<...<pk.A089219
Numbers of the form (p0^x)(p1^(x+1))(p2^(x+2))...(pk^(x+k)), where x and k are positive integers and p0,p1,...,pk are primes with p0<p1<...<pk.
- Duplicate of A052243.A089220
Duplicate of A052243.
- a(n) = floor(sqrt(((prime(n) + primepi(n))/2)^2 + prime(n)*primepi(n))).A089221
a(n) = floor(sqrt(((prime(n) + primepi(n))/2)^2 + prime(n)*primepi(n))).
- Number of ways of seating n people around a table for the second time without anyone sitting next to the same person as they did the first time.A089222
Number of ways of seating n people around a table for the second time without anyone sitting next to the same person as they did the first time.
- a(n) = floor(Product_{i=1..n} log(prime(i+1))/log(i+1)).A089223
a(n) = floor(Product_{i=1..n} log(prime(i+1))/log(i+1)).
- In binary representation: number of zeros of number of zeros of n.A089224
In binary representation: number of zeros of number of zeros of n.
- Triangle T(n,k) read by rows, defined by T(n,k) = (n-k)*T(n-1,k)+Sum(k=1..n, T(n-1,k)); T(1,1) = 1, T(1,k)= 0 if k >1.A089225
Triangle T(n,k) read by rows, defined by T(n,k) = (n-k)*T(n-1,k)+Sum(k=1..n, T(n-1,k)); T(1,1) = 1, T(1,k)= 0 if k >1.
- Smallest composite number with exactly n 1's in binary representation.A089226
Smallest composite number with exactly n 1's in binary representation.
- Numbers k such that 1 + k*ds(k) is prime, where ds(k) is the sum of digits of k.A089227
Numbers k such that 1 + k*ds(k) is prime, where ds(k) is the sum of digits of k.
- Numbers m such that 1 + Sum_{k=1..m} prime(k) is prime.A089228
Numbers m such that 1 + Sum_{k=1..m} prime(k) is prime.
- Neither primes nor square numbers.A089229
Neither primes nor square numbers.
- a(n) =[Floor[Sum[Log[Prime[n+1]]/Log[n+1],{i,1,n}]].A089230
a(n) =[Floor[Sum[Log[Prime[n+1]]/Log[n+1],{i,1,n}]].
- Triangular array A066667 or A008297 unsigned and transposed.A089231
Triangular array A066667 or A008297 unsigned and transposed.
- Numbers of the form (p1^(p1^2))*(p2^(p2^2))*...*(pk^(pk^2)) where p1,p2,..,pk are distinct primes. (In other words: in the prime factorization of any term, the exponent of p is either 0 or p^2 for all prime p).A089232
Numbers of the form (p1^(p1^2))*(p2^(p2^2))*...*(pk^(pk^2)) where p1,p2,..,pk are distinct primes. (In other words: in the prime factorization of any term, the exponent of p is either 0 or p^2 for all prime p).
- Number of coprime pairs of divisors > 1 of n.A089233
Number of coprime pairs of divisors > 1 of n.
- Primes p such that p, p+60, p+120 are consecutive primes.A089234
Primes p such that p, p+60, p+120 are consecutive primes.
- 4-symbol sequence with period 96.A089235
4-symbol sequence with period 96.
- Duplicate of A052239.A089236
Duplicate of A052239.
- List of primes and squares.A089237
List of primes and squares.
- Numbers k such that 3*k^2/2 - 1 is a prime.A089238
Numbers k such that 3*k^2/2 - 1 is a prime.
- Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.A089239
Triangle read by rows: T(n,k) (n >= 0, 0 <= k <= n) giving number of solutions to the n-box stacking problem in which exactly k boxes are used in the stack.
- Column k=4 of triangle in A089239.A089240
Column k=4 of triangle in A089239.
- Even numbers k such that k/2 - 1 is prime.A089241
Even numbers k such that k/2 - 1 is prime.
- Sequence is S(infinity), where S(1) = 1, S(m+1) = concatenation S(m), a(m)+1, S(m) and a(m) is the m-th term of S(m). a(m) is also the m-th term of the sequence.A089242
Sequence is S(infinity), where S(1) = 1, S(m+1) = concatenation S(m), a(m)+1, S(m) and a(m) is the m-th term of S(m). a(m) is also the m-th term of the sequence.
- Number of partitions into strokes of the star graph with n edges on the plane, up to rotations and reflections around the center node.A089243
Number of partitions into strokes of the star graph with n edges on the plane, up to rotations and reflections around the center node.
- Integer part of square root of the reciprocal of a prime number multiplied by 10 to the power of the integer part of the square root of the number.A089244
Integer part of square root of the reciprocal of a prime number multiplied by 10 to the power of the integer part of the square root of the number.
- Integer part of square root of the reciprocal of a number multiplied by 10 to the power of the integer part of the square root of the number.A089245
Integer part of square root of the reciprocal of a number multiplied by 10 to the power of the integer part of the square root of the number.
- Triangular array read by rows: a(n, k) is the number of ordered m-tuples of positive integers (x_1, ..., x_m) such that max x_i = n+1-m and there are k ones (0 <= k <= n).A089246
Triangular array read by rows: a(n, k) is the number of ordered m-tuples of positive integers (x_1, ..., x_m) such that max x_i = n+1-m and there are k ones (0 <= k <= n).
- a(n) = smallest number obtainable by permuting the exponents in the prime factorization of n.A089247
a(n) = smallest number obtainable by permuting the exponents in the prime factorization of n.
- a(n) is the sum of the odd degrees of the irreducible representations of the symmetric group S_n.A089248
a(n) is the sum of the odd degrees of the irreducible representations of the symmetric group S_n.
- Triangular array read by rows illustrating the connection between A000522 and A008292.A089249
Triangular array read by rows illustrating the connection between A000522 and A008292.
- Add 2 (mod 10) to each decimal digit of Pi.A089250
Add 2 (mod 10) to each decimal digit of Pi.
- Number of elements e in all partitions of n such that e divides n.A089251
Number of elements e in all partitions of n such that e divides n.
- a(n) = ((2*n-1)!!/sqrt(3))*(integral_{x=0..sqrt(3/4)} 1/(1-x^2)^(n+1/2) dx).A089252
a(n) = ((2*n-1)!!/sqrt(3))*(integral_{x=0..sqrt(3/4)} 1/(1-x^2)^(n+1/2) dx).
- Numbers n such that 2n - 5 is a prime.A089253
Numbers n such that 2n - 5 is a prime.
- G.f.: Product_{m>=1} 1/(1+x^m)^A000009(m).A089254
G.f.: Product_{m>=1} 1/(1+x^m)^A000009(m).
- Odd numbers n such that 2*n-5 is a prime.A089255
Odd numbers n such that 2*n-5 is a prime.
- Numbers n such that decimal expansion of n^2 has the form D 0 (D+1) for some number D.A089256
Numbers n such that decimal expansion of n^2 has the form D 0 (D+1) for some number D.
- Even numbers n such that 2n-5 is a prime of the form 4k+3.A089257
Even numbers n such that 2n-5 is a prime of the form 4k+3.
- Transposed version of A080955: T(n,k) = A080955(k,n), n>=0, k>=-1.A089258
Transposed version of A080955: T(n,k) = A080955(k,n), n>=0, k>=-1.
- Expansion of Product_{m>=1} 1/(1-x^m)^A000009(m).A089259
Expansion of Product_{m>=1} 1/(1-x^m)^A000009(m).
- Decimal expansion of -x, the largest negative real root of the equation Fibonacci(x) = 0.A089260
Decimal expansion of -x, the largest negative real root of the equation Fibonacci(x) = 0.