Sequences
392,541 sequences
- Expansion of (1-x)^(1/(x-1)).A087761
Expansion of (1-x)^(1/(x-1)).
- Primes whose reversal is a multiple of 7.A087762
Primes whose reversal is a multiple of 7.
- Primes p such that 8^p - 7^p is composite.A087763
Primes p such that 8^p - 7^p is composite.
- Primes whose reversal is a multiple of 13.A087764
Primes whose reversal is a multiple of 13.
- Primes whose reversal is a multiple of 17.A087765
Primes whose reversal is a multiple of 17.
- Primes whose reversal is a multiple of 19.A087766
Primes whose reversal is a multiple of 19.
- Primes whose reversal is a multiple of 23.A087767
Primes whose reversal is a multiple of 23.
- Minimal prime whose reversal is a multiple of n, or 0 if no such prime exists.A087768
Minimal prime whose reversal is a multiple of n, or 0 if no such prime exists.
- Minimal prime whose reversal is a multiple of n-th prime.A087769
Minimal prime whose reversal is a multiple of n-th prime.
- "Lonely primes": those primes that are locally maximally isolated from the nearest other primes. The differences between each lonely prime and the immediately preceding prime and following primes are both greater than the corresponding differences for all lonely primes earlier in the sequence.A087770
"Lonely primes": those primes that are locally maximally isolated from the nearest other primes. The differences between each lonely prime and the immediately preceding prime and following primes are both greater than the corresponding differences for all lonely primes earlier in the sequence.
- Primes p giving prime quadruples (30p+11, 30p+13, 30p+17, 30p+19).A087771
Primes p giving prime quadruples (30p+11, 30p+13, 30p+17, 30p+19).
- Numbers n such that s=n^2 gives prime quadruples (30s+11, 30s+13, 30s+17, 30s+19).A087772
Numbers n such that s=n^2 gives prime quadruples (30s+11, 30s+13, 30s+17, 30s+19).
- Number of common decimal digits of n and 2^n.A087773
Number of common decimal digits of n and 2^n.
- a[1] = 1, a[2] = a[3] = 2; a[n] = 3*a[a[n-1]] - 3*a[n-a[n-1]]+a[n-3].A087774
a[1] = 1, a[2] = a[3] = 2; a[n] = 3*a[a[n-1]] - 3*a[n-a[n-1]]+a[n-3].
- a[1] = 1, a[2] = 2, a[3] = 2; a[n] = 3*a[abs[a[n-2]]] - 3*a[n-abs[a[n-2]]] + a[n-3].A087775
a[1] = 1, a[2] = 2, a[3] = 2; a[n] = 3*a[abs[a[n-2]]] - 3*a[n-abs[a[n-2]]] + a[n-3].
- Primes prime(k) such that -prime(k-2) + 2*prime(k-1) - 2*prime(k+1) + prime(k+2) == 0.A087776
Primes prime(k) such that -prime(k-2) + 2*prime(k-1) - 2*prime(k+1) + prime(k+2) == 0.
- a(1) = ... = a(4) = 1; a(n) = a(n - a(n-2)) + a(n - a(n-4)).A087777
a(1) = ... = a(4) = 1; a(n) = a(n - a(n-2)) + a(n - a(n-4)).
- Decimal expansion of experimental Avogadro's constant (in mol^(-1)).A087778
Decimal expansion of experimental Avogadro's constant (in mol^(-1)).
- a(n)=prime(x) is the smallest prime such that 1+(2^(12n+9))*prime(x) is divisible by prime(x+1).A087779
a(n)=prime(x) is the smallest prime such that 1+(2^(12n+9))*prime(x) is divisible by prime(x+1).
- Number of non-congruent solutions to x^2 == 2 mod n.A087780
Number of non-congruent solutions to x^2 == 2 mod n.
- Number of non-congruent solutions to x^2 - x - 1 == 0 mod n.A087781
Number of non-congruent solutions to x^2 - x - 1 == 0 mod n.
- a(n) = number of solutions to x^3 + x == 0 (mod n).A087782
a(n) = number of solutions to x^3 + x == 0 (mod n).
- Array T(n,k) (n >= 1, k >= 1) read by antidiagonals, giving number of ways of arranging the numbers 1 ... mn into an m X n array so there is exactly one local maximum.A087783
Array T(n,k) (n >= 1, k >= 1) read by antidiagonals, giving number of ways of arranging the numbers 1 ... mn into an m X n array so there is exactly one local maximum.
- Number of solutions to x^2 + y^2 + z^2 = 1 mod n.A087784
Number of solutions to x^2 + y^2 + z^2 = 1 mod n.
- Number of elements in GL(2,Z_n) x with x^2 == -I mod n where I is the identity matrix.A087785
Number of elements in GL(2,Z_n) x with x^2 == -I mod n where I is the identity matrix.
- a(n) = number of solutions to x^3 - y^3 == 0 (mod n).A087786
a(n) = number of solutions to x^3 - y^3 == 0 (mod n).
- a(n) = Sum_{k=0..n} (-1)^(n-k)*A000041(k).A087787
a(n) = Sum_{k=0..n} (-1)^(n-k)*A000041(k).
- 3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p*q*r, where p < q < r are primes such that a^(k-1) == 1 (mod k) if a is prime to k.A087788
3-Carmichael numbers: Carmichael numbers equal to the product of 3 primes: k = p*q*r, where p < q < r are primes such that a^(k-1) == 1 (mod k) if a is prime to k.
- Smallest number greater than n having the same greatest prime factor as n; a(1)=1.A087789
Smallest number greater than n having the same greatest prime factor as n; a(1)=1.
- Partial sums of A085068.A087790
Partial sums of A085068.
- Indices n such that S^n(1) is an integer where S(x) = 3/2*ceiling(x).A087791
Indices n such that S^n(1) is an integer where S(x) = 3/2*ceiling(x).
- Indices n such that S^n(1) is an integer where S(x) = 4/3*ceiling(x).A087792
Indices n such that S^n(1) is an integer where S(x) = 4/3*ceiling(x).
- Least k such that S^k(n)=n^2 where S(x)=n*ceiling(sqrt(x)).A087793
Least k such that S^k(n)=n^2 where S(x)=n*ceiling(sqrt(x)).
- Products of prime-indices of factors of semiprimes.A087794
Products of prime-indices of factors of semiprimes.
- Minimal last term of an n-tuple of pairwise coprime composites in A.P.A087795
Minimal last term of an n-tuple of pairwise coprime composites in A.P.
- Corresponding common difference associated with A087795.A087796
Corresponding common difference associated with A087795.
- Primes, squares of primes and cubes of primes.A087797
Primes, squares of primes and cubes of primes.
- a(n) = 9*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 9.A087798
a(n) = 9*a(n-1) + a(n-2), starting with a(0) = 2 and a(1) = 9.
- a(n) = 10*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 10.A087799
a(n) = 10*a(n-1) - a(n-2), starting with a(0) = 2 and a(1) = 10.
- a(n) = 12*a(n-1) - a(n-2), with a(0) = 2 and a(1) = 12.A087800
a(n) = 12*a(n-1) - a(n-2), with a(0) = 2 and a(1) = 12.
- Greatest common divisor of tau(n)+sigma(n) and tau(n)*sigma(n), where tau = A000005 and sigma = A000203.A087801
Greatest common divisor of tau(n)+sigma(n) and tau(n)*sigma(n), where tau = A000005 and sigma = A000203.
- a(n) = Sum_{d|n, d nonprime} mu(d), where mu = A008683.A087802
a(n) = Sum_{d|n, d nonprime} mu(d), where mu = A008683.
- Number of unlabeled rooted trees with at most n nodes.A087803
Number of unlabeled rooted trees with at most n nodes.
- Binomial transform of squares of Catalan numbers.A087804
Binomial transform of squares of Catalan numbers.
- Partial sums of b(k) where {b(k)}_{k>=0} = lim_{n->oo} {A080578(k)-2k : k=2^n,2^n+1,2^n+2,...}.A087805
Partial sums of b(k) where {b(k)}_{k>=0} = lim_{n->oo} {A080578(k)-2k : k=2^n,2^n+1,2^n+2,...}.
- Inverse binomial transform of squares of Catalan numbers.A087806
Inverse binomial transform of squares of Catalan numbers.
- Prime factors of solutions to 24^n == 1 (mod n).A087807
Prime factors of solutions to 24^n == 1 (mod n).
- a(0) = 0; a(2n) = 2a(n), a(2n+1) = a(n) + 1.A087808
a(0) = 0; a(2n) = 2a(n), a(2n+1) = a(n) + 1.
- Number of triangulations (by Euclidean triangles) having 3+3n vertices of a triangle with each side subdivided by n additional points.A087809
Number of triangulations (by Euclidean triangles) having 3+3n vertices of a triangle with each side subdivided by n additional points.
- First differences of A029931.A087810
First differences of A029931.