Sequences
392,541 sequences
- n rotated one binary place to the right less n rotated one binary place to the left.A088161
n rotated one binary place to the right less n rotated one binary place to the left.
- n-th prime rotated one binary place to the right less the n-th prime rotated one binary place to the left.A088162
n-th prime rotated one binary place to the right less the n-th prime rotated one binary place to the left.
- Numbers for which rotating one binary place to the right less rotating one binary place to the left is equal to zero.A088163
Numbers for which rotating one binary place to the right less rotating one binary place to the left is equal to zero.
- Wolstenholme primes: primes p such that binomial(2p-1,p-1) == 1 (mod p^4).A088164
Wolstenholme primes: primes p such that binomial(2p-1,p-1) == 1 (mod p^4).
- NSW primes: NSW numbers that are also prime.A088165
NSW primes: NSW numbers that are also prime.
- Smallest integer divisible by Fibonacci(2n) such that the second partial quotient in the continued fraction expansion of a(n)/phi is 2 (phi is the golden ratio), n >= 2.A088166
Smallest integer divisible by Fibonacci(2n) such that the second partial quotient in the continued fraction expansion of a(n)/phi is 2 (phi is the golden ratio), n >= 2.
- Number of earlier occurring divisors of n; a(1)=1.A088167
Number of earlier occurring divisors of n; a(1)=1.
- Smallest number m such that A088167(m)=n.A088168
Smallest number m such that A088167(m)=n.
- Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty and all elements of S(n) have the same number of digits as n.A088169
Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty and all elements of S(n) have the same number of digits as n.
- Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty and all elements of S(n) have one digit less than n has.A088170
Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty and all elements of S(n) have one digit less than n has.
- Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty, at least one element of S(n) has the same number of digits as n and at least one element of S(n) has one digit less than n has.A088171
Numbers n such that the set S(n) = {k: k + reverse(k) = n} is not empty, at least one element of S(n) has the same number of digits as n and at least one element of S(n) has one digit less than n has.
- First differences of A019300.A088172
First differences of A019300.
- Primes whose successive differences are increasing squares.A088173
Primes whose successive differences are increasing squares.
- Numbers n such that n^2 appears in A088173.A088174
Numbers n such that n^2 appears in A088173.
- Primes such that the next two primes are a twin prime pair.A088175
Primes such that the next two primes are a twin prime pair.
- Primes such that the previous two primes are a twin prime pair.A088176
Primes such that the previous two primes are a twin prime pair.
- a(1)=1, a(2)=1; for n>2, a(n) is the smallest positive integer such that the products a(i)*a(i+1), i=1..n-1, are all distinct.A088177
a(1)=1, a(2)=1; for n>2, a(n) is the smallest positive integer such that the products a(i)*a(i+1), i=1..n-1, are all distinct.
- Sequence of distinct products b(n)*b(n+1), n=1,2,3,..., of the terms b(n) of A088177.A088178
Sequence of distinct products b(n)*b(n+1), n=1,2,3,..., of the terms b(n) of A088177.
- Primes p such that mu(p-1) = 1; that is, p-1 is squarefree and has an even number of prime factors, where mu is the Moebius function.A088179
Primes p such that mu(p-1) = 1; that is, p-1 is squarefree and has an even number of prime factors, where mu is the Moebius function.
- a(n) is the number of numbers m < 10^n for which there is at least one k such that k + reverse(k) = m.A088180
a(n) is the number of numbers m < 10^n for which there is at least one k such that k + reverse(k) = m.
- E.g.f.: 1/(1-sinh(x)-x).A088181
E.g.f.: 1/(1-sinh(x)-x).
- E.g.f.: 1/(1-sinh(x)-x-x^2/2).A088182
E.g.f.: 1/(1-sinh(x)-x-x^2/2).
- Number of ways to write n as a sum of two coprime semiprimes.A088183
Number of ways to write n as a sum of two coprime semiprimes.
- Numbers that can be written as sum of two coprime semiprimes.A088184
Numbers that can be written as sum of two coprime semiprimes.
- Numbers which are not the sum of two coprime semiprimes.A088185
Numbers which are not the sum of two coprime semiprimes.
- Sums of twin primes and their indices.A088186
Sums of twin primes and their indices.
- Primes that are a sum of twin primes and their indices.A088187
Primes that are a sum of twin primes and their indices.
- Squares that are a sum of twin primes and their indices.A088188
Squares that are a sum of twin primes and their indices.
- Expansion of e.g.f.: 1/(1-sinh(x)-x-x^2).A088189
Expansion of e.g.f.: 1/(1-sinh(x)-x-x^2).
- Largest quadratic residue modulo prime(n).A088190
Largest quadratic residue modulo prime(n).
- First differences of A088190.A088191
First differences of A088190.
- Distance between prime(n) and the largest quadratic residue modulo prime(n).A088192
Distance between prime(n) and the largest quadratic residue modulo prime(n).
- Prime numbers where the sequence of largest quadratic residues modulo the primes (A088190) is non-monotonic.A088193
Prime numbers where the sequence of largest quadratic residues modulo the primes (A088190) is non-monotonic.
- Members of the difference sequence (A088191) of the sequence of largest quadratic residues modulo the primes (A088190), where the latter is non-monotonic.A088194
Members of the difference sequence (A088191) of the sequence of largest quadratic residues modulo the primes (A088190), where the latter is non-monotonic.
- Distance (A088192) of primes from the largest quadratic residues modulo the primes (A088190), where the latter is non-monotonic.A088195
Distance (A088192) of primes from the largest quadratic residues modulo the primes (A088190), where the latter is non-monotonic.
- Largest number that is not a quadratic residue modulo prime(n).A088196
Largest number that is not a quadratic residue modulo prime(n).
- First differences of A088196.A088197
First differences of A088196.
- Distance LQnR(p_n) (A088196) from p_n.A088198
Distance LQnR(p_n) (A088196) from p_n.
- Primes where the difference sequence (A088197) of LQnR(p_n) (A088196) is <= 0.A088199
Primes where the difference sequence (A088197) of LQnR(p_n) (A088196) is <= 0.
- Members of the difference sequence (A088197) of LQnR(p_n) (A088196) where it is <= 0.A088200
Members of the difference sequence (A088197) of LQnR(p_n) (A088196) where it is <= 0.
- Distance p_n-LQnR(p_n) (A088198) where the difference sequence (A088197) of LQnR(p_n) (A088196) is <= 0.A088201
Distance p_n-LQnR(p_n) (A088198) where the difference sequence (A088197) of LQnR(p_n) (A088196) is <= 0.
- Chromatic number of the n X n queen graph.A088202
Chromatic number of the n X n queen graph.
- Infinite audioactive word that shifts 1 place left under "Look and Say" method A, starting with a(1)=2.A088203
Infinite audioactive word that shifts 1 place left under "Look and Say" method A, starting with a(1)=2.
- Infinite audioactive word that shifts 1 place left under "Look and Say" method A, starting with a(1)=3.A088204
Infinite audioactive word that shifts 1 place left under "Look and Say" method A, starting with a(1)=3.
- Infinite audioactive word that shifts 1 place left under "Look and Say" method A, starting with a(0)=0.A088205
Infinite audioactive word that shifts 1 place left under "Look and Say" method A, starting with a(0)=0.
- Positions of zero in the infinite audioactive word, A088205, which shifts left under "Look and Say" method A, starting with a(1)=0.A088206
Positions of zero in the infinite audioactive word, A088205, which shifts left under "Look and Say" method A, starting with a(1)=0.
- a(n) = Sum_{k=0..n} floor(k*phi^2) where phi=(1+sqrt(5))/2.A088207
a(n) = Sum_{k=0..n} floor(k*phi^2) where phi=(1+sqrt(5))/2.
- Table read by rows where T(0,0)=1; n-th row has 2^n terms T(n,j),j=0 to 2^n-1. For j==0 mod 2, T(n+1,2j)=T(n,j) and T(n+1,2j+1)=T(n,j)+2^n. For j==1 mod 2, T(n+1,2j+1)=T(n,j) and T(n+1,2j)=T(n,j)+2^n.A088208
Table read by rows where T(0,0)=1; n-th row has 2^n terms T(n,j),j=0 to 2^n-1. For j==0 mod 2, T(n+1,2j)=T(n,j) and T(n+1,2j+1)=T(n,j)+2^n. For j==1 mod 2, T(n+1,2j+1)=T(n,j) and T(n+1,2j)=T(n,j)+2^n.
- Numerators of convergents of the continued fraction with the n+1 partial quotients: [1;1,1,...(n 1's)...,1,n+1], starting with [1], [1;2], [1;1,3], [1;1,1,4], ...A088209
Numerators of convergents of the continued fraction with the n+1 partial quotients: [1;1,1,...(n 1's)...,1,n+1], starting with [1], [1;2], [1;1,3], [1;1,1,4], ...
- Numerators of convergents of the continued fraction with the n+1 partial quotients: [2;2,2,...(n 2's)...,2,n+1], starting with [1], [2;2], [2;2,3], [2;2,2,4], ...A088210
Numerators of convergents of the continued fraction with the n+1 partial quotients: [2;2,2,...(n 2's)...,2,n+1], starting with [1], [2;2], [2;2,3], [2;2,2,4], ...