Sequences
392,541 sequences
- Smallest prime p that is a palindrome in n different bases < p.A087911
Smallest prime p that is a palindrome in n different bases < p.
- Exponential generating function is exp(2*x/(1-x))/(1-x).A087912
Exponential generating function is exp(2*x/(1-x))/(1-x).
- Greatest number less than n such that the number of prime factors is one less than that of n; a(1)=0.A087913
Greatest number less than n such that the number of prime factors is one less than that of n; a(1)=0.
- Numbers m such that A007947(m) = A007947(k) and A007947(m+1) = A007947(k+1), for some k < m.A087914
Numbers m such that A007947(m) = A007947(k) and A007947(m+1) = A007947(k+1), for some k < m.
- Even numbers k such that 2*k+3 is a prime.A087915
Even numbers k such that 2*k+3 is a prime.
- Number of ordered ways to write 2n+1 as a sum of 3 odd primes.A087916
Number of ordered ways to write 2n+1 as a sum of 3 odd primes.
- Number of unordered ways to write n as a sum of 3 odious numbers (A000069).A087917
Number of unordered ways to write n as a sum of 3 odious numbers (A000069).
- Let A(n) be the matrix in the group GL(n,2) such that for 1<=i, j<=n: A[i,j] = 1 if i+j = n+1 A[i,j] = 0 if i+j != n+1. a(n) is the size of the conjugacy class of A(n) in GL(n,2).A087918
Let A(n) be the matrix in the group GL(n,2) such that for 1<=i, j<=n: A[i,j] = 1 if i+j = n+1 A[i,j] = 0 if i+j != n+1. a(n) is the size of the conjugacy class of A(n) in GL(n,2).
- Indices for which there is at least one twin prime pair between two consecutive prime-indexed primes.A087919
Indices for which there is at least one twin prime pair between two consecutive prime-indexed primes.
- Indices for which there is no twin prime pair between two consecutive prime-indexed primes.A087920
Indices for which there is no twin prime pair between two consecutive prime-indexed primes.
- Numbers k such that the interval [prime(prime(prime(k))) ... prime(prime(prime(k+1)))] contains no twin prime pair.A087921
Numbers k such that the interval [prime(prime(prime(k))) ... prime(prime(prime(k+1)))] contains no twin prime pair.
- Duplicate of A087921.A087922
Duplicate of A087921.
- Number of ways of arranging the numbers 1 ... 2n into a 2 X n array so there is exactly one local maximum.A087923
Number of ways of arranging the numbers 1 ... 2n into a 2 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 3n into a 3 X n array so there is exactly one local maximum.A087924
Number of ways of arranging the numbers 1 ... 3n into a 3 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 4n into a 4 X n array so there is exactly one local maximum.A087925
Number of ways of arranging the numbers 1 ... 4n into a 4 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 5n into a 5 X n array so there is exactly one local maximum.A087926
Number of ways of arranging the numbers 1 ... 5n into a 5 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 6n into a 6 X n array so there is exactly one local maximum.A087927
Number of ways of arranging the numbers 1 ... 6n into a 6 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 7n into a 7 X n array so there is exactly one local maximum.A087928
Number of ways of arranging the numbers 1 ... 7n into a 7 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 8n into an 8 X n array so there is exactly one local maximum.A087929
Number of ways of arranging the numbers 1 ... 8n into an 8 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 9n into a 9 X n array so there is exactly one local maximum.A087930
Number of ways of arranging the numbers 1 ... 9n into a 9 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 10n into a 10 X n array so there is exactly one local maximum.A087931
Number of ways of arranging the numbers 1 ... 10n into a 10 X n array so there is exactly one local maximum.
- Number of ways of arranging the numbers 1 ... 11n into an 11 X n array so there is exactly one local maximum.A087932
Number of ways of arranging the numbers 1 ... 11n into an 11 X n array so there is exactly one local maximum.
- Primes p such that pi(2^k) = p, for some k > 1.A087933
Primes p such that pi(2^k) = p, for some k > 1.
- a(n) is the least k>=0 such that P(x)=(x-1)*(x-2)*..(x-n)-k has only 1 real root if n is odd, only 2 real roots if n is even.A087934
a(n) is the least k>=0 such that P(x)=(x-1)*(x-2)*..(x-n)-k has only 1 real root if n is odd, only 2 real roots if n is even.
- Perrin sequence of order 5.A087935
Perrin sequence of order 5.
- Perrin sequence of order 6.A087936
Perrin sequence of order 6.
- Prime hypotenuse of primitive Pythagorean triangles with even short leg (or odd long leg).A087937
Prime hypotenuse of primitive Pythagorean triangles with even short leg (or odd long leg).
- Prime hypotenuse of primitive Pythagorean triangles with odd short leg (or even long leg).A087938
Prime hypotenuse of primitive Pythagorean triangles with odd short leg (or even long leg).
- Prime hypotenuse of primitive Pythagorean triangles with nonprime odd short leg.A087939
Prime hypotenuse of primitive Pythagorean triangles with nonprime odd short leg.
- a(n) = Sum_{k=0..n} binomial(n+(-1)^k, k).A087940
a(n) = Sum_{k=0..n} binomial(n+(-1)^k, k).
- a(n) is the number of consecutive primes x-2,x+2 such that x=j*(p(n)#/2)/p(k), where 1 <= j < p(n+1) and 2 <= k <= n and p(k) doesn't divide j.A087941
a(n) is the number of consecutive primes x-2,x+2 such that x=j*(p(n)#/2)/p(k), where 1 <= j < p(n+1) and 2 <= k <= n and p(k) doesn't divide j.
- Number of partitions of n into as many primes as n has prime factors.A087942
Number of partitions of n into as many primes as n has prime factors.
- Numbers n such that 3 divides sigma(n).A087943
Numbers n such that 3 divides sigma(n).
- Expansion of (1-4*x+3*x^2)/((1-2*x)*(1-4*x+x^2)).A087944
Expansion of (1-4*x+3*x^2)/((1-2*x)*(1-4*x+x^2)).
- Expansion of (1-2x-x^2)/((1-2x)(1-4x+x^2)).A087945
Expansion of (1-2x-x^2)/((1-2x)(1-4x+x^2)).
- Expansion of (1-3x+x^2)/((1-2x)(1-4x+x^2)).A087946
Expansion of (1-3x+x^2)/((1-2x)(1-4x+x^2)).
- Sum of successive remainders in computing Euclidean algorithm for (1, 1/sqrt(-n)) has real and imaginary parts equal.A087947
Sum of successive remainders in computing Euclidean algorithm for (1, 1/sqrt(-n)) has real and imaginary parts equal.
- Sum of successive remainders in computing euclidean algorithm for (1, -1/sqrt(-n)) has real and imaginary parts equal.A087948
Sum of successive remainders in computing euclidean algorithm for (1, -1/sqrt(-n)) has real and imaginary parts equal.
- G.f. satisfies A(x) = 1 + x*A(x*A(x)).A087949
G.f. satisfies A(x) = 1 + x*A(x*A(x)).
- Numerators k for which the partial quotients of the k-CF of sqrt(2) are periodic, where a k-CF is defined as the continued fraction representation having k as the constant numerator: x = q_0 + k/(q_1 + k/(q_2 + k/(q_3 +...))).A087950
Numerators k for which the partial quotients of the k-CF of sqrt(2) are periodic, where a k-CF is defined as the continued fraction representation having k as the constant numerator: x = q_0 + k/(q_1 + k/(q_2 + k/(q_3 +...))).
- Partial quotients of the continued fraction of sqrt(2), having 8 as the constant numerator: sqrt(2) = a(0) + 8/(a(1) + 8/(a(2) + 8/(a(3) +...))).A087951
Partial quotients of the continued fraction of sqrt(2), having 8 as the constant numerator: sqrt(2) = a(0) + 8/(a(1) + 8/(a(2) + 8/(a(3) +...))).
- Smallest prime == 1 (mod n) and > n^2.A087952
Smallest prime == 1 (mod n) and > n^2.
- a(n) = floor((Fibonacci(2*n+1)+1)/2).A087953
a(n) = floor((Fibonacci(2*n+1)+1)/2).
- (2 + phi)/a(n) is the sum of successive remainders when computing the Euclidean algorithm for (1, A088166(n)/phi) with phi being the golden ratio, where n >= 2.A087954
(2 + phi)/a(n) is the sum of successive remainders when computing the Euclidean algorithm for (1, A088166(n)/phi) with phi being the golden ratio, where n >= 2.
- a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=2.A087955
a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=2.
- a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=3.A087956
a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=3.
- a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=4.A087957
a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=4.
- a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=5.A087958
a(n) is the square of the n-th partial sum minus the n-th partial sum of the squares, divided by a(n-1), for all n>=1, starting with a(0)=1, a(1)=5.
- G.f. satisfies A(x) = 1 + x*A(x*A(x*A(x))).A087959
G.f. satisfies A(x) = 1 + x*A(x*A(x*A(x))).
- a(n) = (-1)^binomial(n+1,2).A087960
a(n) = (-1)^binomial(n+1,2).