Sequences
392,541 sequences
- Numbers m that are a product of two primes j and k such that both m+j+k and m-j-k are primes.A088711
Numbers m that are a product of two primes j and k such that both m+j+k and m-j-k are primes.
- Primes which when concatenated with the previous prime form a new prime.A088712
Primes which when concatenated with the previous prime form a new prime.
- G.f. A(x) satisfies A(x/A(x)) = 1/(1-x).A088713
G.f. A(x) satisfies A(x/A(x)) = 1/(1-x).
- G.f. satisfies A(x) = 1 + x*A(x)^2*A(x*A(x)).A088714
G.f. satisfies A(x) = 1 + x*A(x)^2*A(x*A(x)).
- G.f. satisfies: A(x*g(x)) = g(x) where g(x) is the g.f. of A088716.A088715
G.f. satisfies: A(x*g(x)) = g(x) where g(x) is the g.f. of A088716.
- G.f. satisfies: A(x) = 1 + x*A(x)*d/dx[x*A(x)] = 1 + x*A(x)^2 + x^2*A(x)*A'(x).A088716
G.f. satisfies: A(x) = 1 + x*A(x)*d/dx[x*A(x)] = 1 + x*A(x)^2 + x^2*A(x)*A'(x).
- G.f. satisfies: A(x) = 1 + x*A(x)^2*A(x*A(x)^2).A088717
G.f. satisfies: A(x) = 1 + x*A(x)^2*A(x*A(x)^2).
- a(n)= Gamma(n+2) *Gamma(n+1) *2F2(n+2, n+1; 2, 2; 1)/exp(1), where 2F2(;;) is a generalized hypergeometric series.A088718
a(n)= Gamma(n+2) *Gamma(n+1) *2F2(n+2, n+1; 2, 2; 1)/exp(1), where 2F2(;;) is a generalized hypergeometric series.
- Numbers that can be represented as a^7 + b^7, with 0 < a < b, in exactly one way.A088719
Numbers that can be represented as a^7 + b^7, with 0 < a < b, in exactly one way.
- Unique monotone sequence satisfying a(a(a(n))) = 2n.A088720
Unique monotone sequence satisfying a(a(a(n))) = 2n.
- Unique monotone sequence satisfying a(a(a(a(n)))) = 2n.A088721
Unique monotone sequence satisfying a(a(a(a(n)))) = 2n.
- Number of divisors d>1 of n such that d+1 also divides n.A088722
Number of divisors d>1 of n such that d+1 also divides n.
- Numbers k with at least one divisor d>1 such that d+1 also divides k.A088723
Numbers k with at least one divisor d>1 such that d+1 also divides k.
- Numbers having exactly one divisor d>1 such that also d+1 is a divisor.A088724
Numbers having exactly one divisor d>1 such that also d+1 is a divisor.
- Numbers having no divisors d>1 such that also d+1 is a divisor.A088725
Numbers having no divisors d>1 such that also d+1 is a divisor.
- Smallest numbers having exactly n divisors d>1 such that also d+1 is a divisor.A088726
Smallest numbers having exactly n divisors d>1 such that also d+1 is a divisor.
- a(n) is the (n-1)st smallest number that is the sum of 2 distinct positive n-th powers.A088727
a(n) is the (n-1)st smallest number that is the sum of 2 distinct positive n-th powers.
- p such that p^4 + q^4 = r^4 + s^4 = a(n).A088728
p such that p^4 + q^4 = r^4 + s^4 = a(n).
- Matrix product of Stirling2-triangle A008277(n,k) and unsigned Lah-triangle |A008297(n,k)|.A088729
Matrix product of Stirling2-triangle A008277(n,k) and unsigned Lah-triangle |A008297(n,k)|.
- Numbers of the form p^p - 1, where p is a prime.A088730
Numbers of the form p^p - 1, where p is a prime.
- Numbers of the form p^p - 3 where p is prime.A088731
Numbers of the form p^p - 3 where p is prime.
- First prime in the arithmetic progression n+k*(n+1) with k>0.A088732
First prime in the arithmetic progression n+k*(n+1) with k>0.
- n-th prime in the arithmetic progression n+k*(n+1) with k>0.A088733
n-th prime in the arithmetic progression n+k*(n+1) with k>0.
- First primes in p^p - 2m where p is prime and m = 1,2..A088734
First primes in p^p - 2m where p is prime and m = 1,2..
- Sum of the digits of n^(n^n).A088735
Sum of the digits of n^(n^n).
- 10^p - p for prime p.A088736
10^p - p for prime p.
- Number of semiprime divisors of n-th composite number.A088737
Number of semiprime divisors of n-th composite number.
- Sum of semiprime divisors of n-th composite number.A088738
Sum of semiprime divisors of n-th composite number.
- Smallest semiprime divisor of n-th composite number.A088739
Smallest semiprime divisor of n-th composite number.
- Greatest semiprime divisor of n-th composite number.A088740
Greatest semiprime divisor of n-th composite number.
- Number of connected strongly regular simple graphs on n nodes.A088741
Number of connected strongly regular simple graphs on n nodes.
- Run lengths of A088023.A088742
Run lengths of A088023.
- a(n) = 2*A088023(n) - 1.A088743
a(n) = 2*A088023(n) - 1.
- a(n) = 3*A088023(n) - 2.A088744
a(n) = 3*A088023(n) - 2.
- Infinite array read by antidiagonals: for n>=1 let T_n = upper left n X n matrix. Then T_1 = (1), T_n has elements 1..n^2, contains T_{n-1} as n-1 X n-1 upper left submatrix and abs(det(T_n)) is a maximized.A088745
Infinite array read by antidiagonals: for n>=1 let T_n = upper left n X n matrix. Then T_1 = (1), T_n has elements 1..n^2, contains T_{n-1} as n-1 X n-1 upper left submatrix and abs(det(T_n)) is a maximized.
- a(n) = determinant of upper left n X n matrix A_n of matrix A088745, where A_n has elements 1..n^2 with abs(det(A_n)) = max by adding elements on the lower and right border.A088746
a(n) = determinant of upper left n X n matrix A_n of matrix A088745, where A_n has elements 1..n^2 with abs(det(A_n)) = max by adding elements on the lower and right border.
- a(n) = prime(Pell(n)).A088747
a(n) = prime(Pell(n)).
- a(n) = 1 + Sum_{k=0..n-1} 2 * A014577(k) - 1.A088748
a(n) = 1 + Sum_{k=0..n-1} 2 * A014577(k) - 1.
- Numbers of the lines Im zeta(sigma + i t)=0 that escape to the right.A088749
Numbers of the lines Im zeta(sigma + i t)=0 that escape to the right.
- a(n) is the index of that zero of the Riemann zeta function on the same line as the Gram point g(n-2). It is only well-defined if the Riemann hypothesis is true.A088750
a(n) is the index of that zero of the Riemann zeta function on the same line as the Gram point g(n-2). It is only well-defined if the Riemann hypothesis is true.
- Decimal expansion of -x, the real root of the equation 0 = 1 + Sum_{k>=1} prime(k) x^k. The inverse of Backhouse's constant (A072508).A088751
Decimal expansion of -x, the real root of the equation 0 = 1 + Sum_{k>=1} prime(k) x^k. The inverse of Backhouse's constant (A072508).
- Let CompositePi(n) = number of composite numbers <= n and PrimePi(n) = number of primes <= n, so that CompositePi(n) + PrimePi(n) = n. Then a(n) = floor(n*(n - PrimePi(n))/(n-1-PrimePi(n-1) + n - 2 - PrimePi(n-2))).A088752
Let CompositePi(n) = number of composite numbers <= n and PrimePi(n) = number of primes <= n, so that CompositePi(n) + PrimePi(n) = n. Then a(n) = floor(n*(n - PrimePi(n))/(n-1-PrimePi(n-1) + n - 2 - PrimePi(n-2))).
- Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.A088753
Numbers k such that the Reverse and Add! trajectory of k (presumably) does not reach a palindrome (with the exception of k itself) and does not join the trajectory of any term m < k.
- Number of n-digit primes beginning with prime(n).A088754
Number of n-digit primes beginning with prime(n).
- Number of n-digit primes beginning with n.A088755
Number of n-digit primes beginning with n.
- a(n)=A088599(n)/n.A088756
a(n)=A088599(n)/n.
- a(n) = index of the first occurrence of n in A088606.A088757
a(n) = index of the first occurrence of n in A088606.
- Numbers k such that (4*k + 1)^2 + (4*k + 2)^2 is prime.A088758
Numbers k such that (4*k + 1)^2 + (4*k + 2)^2 is prime.
- Numbers k such that (4*k+3)^2 + (4*k+2)^2 is prime.A088759
Numbers k such that (4*k+3)^2 + (4*k+2)^2 is prime.
- a(1) = 1; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.A088760
a(1) = 1; a(n) is the smallest multiple of a(n-1) that contains all the digits of a(n-1) and is not a multiple of 10.