Sequences
392,541 sequences
- Number of solutions to x^2 + 2y^2 == 0 (mod n).A087561
Number of solutions to x^2 + 2y^2 == 0 (mod n).
- Primes such that the next n successive differences are identical.A087562
Primes such that the next n successive differences are identical.
- Erroneous version of A086547.A087563
Erroneous version of A086547.
- a(n) = smallest prime of the form n*(n+1)*(n+2)*...*(n+k) + 1, or 0 if no such prime exists.A087564
a(n) = smallest prime of the form n*(n+1)*(n+2)*...*(n+k) + 1, or 0 if no such prime exists.
- a(n) = smallest k such that n*(n+1)*(n+2)...(n+k) + 1 is prime, or -1 if no prime of such form exists.A087565
a(n) = smallest k such that n*(n+1)*(n+2)...(n+k) + 1 is prime, or -1 if no prime of such form exists.
- a(n) = index of the first occurrence of n in A087565, or 0 if n is not a term of A087565.A087566
a(n) = index of the first occurrence of n in A087565, or 0 if n is not a term of A087565.
- a(n) = (1/5)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*5^k.A087567
a(n) = (1/5)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*5^k.
- Erroneous version of A092927.A087568
Erroneous version of A092927.
- Erroneous version of A092928.A087569
Erroneous version of A092928.
- Erroneous version of A093016.A087570
Erroneous version of A093016.
- Smallest prime which has the form of the concatenation n, n-1, n-2, n-3, .., n-k for some k < n, or 0 if no such prime exists.A087571
Smallest prime which has the form of the concatenation n, n-1, n-2, n-3, .., n-k for some k < n, or 0 if no such prime exists.
- Smallest prime of the form n + (n-1) + (n-2) + ...(n-k), k < n, or 0 if no such prime exists.A087572
Smallest prime of the form n + (n-1) + (n-2) + ...(n-k), k < n, or 0 if no such prime exists.
- Smallest number k such that prime(4) + k, prime(5) + k, ..., prime(n+3) + k are all prime.A087573
Smallest number k such that prime(4) + k, prime(5) + k, ..., prime(n+3) + k are all prime.
- a(1) = 1, then the smallest number such that the n-th partial concatenation has a prime signature of n.A087574
a(1) = 1, then the smallest number such that the n-th partial concatenation has a prime signature of n.
- Smallest prime p such that 2+p^n is a prime, or 0 if no such prime exists.A087575
Smallest prime p such that 2+p^n is a prime, or 0 if no such prime exists.
- Smallest number k > 1 such that k^n+2 is prime.A087576
Smallest number k > 1 such that k^n+2 is prime.
- Smallest number k such that k^n + 3 is a prime.A087577
Smallest number k such that k^n + 3 is a prime.
- Duplicate of A023195.A087578
Duplicate of A023195.
- a(n) = (1/6)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*6^k.A087579
a(n) = (1/6)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*6^k.
- Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1).A087580
Primes with n-th successive differences a multiple of Fibonacci(n+1). a(n)-a(n-1) == 0 (mod F(n+1)), F(n+1) = A000045(n+1).
- Primes such that successive differences are increasing palindromes.A087581
Primes such that successive differences are increasing palindromes.
- Primes such that successive differences are distinct palindromes.A087582
Primes such that successive differences are distinct palindromes.
- Distinct primes such that the absolute values of successive differences are distinct palindromes. a(n+1) is chosen to be < a(n) if such a prime exists, minimizing a(n)-a(n+1); otherwise the minimal a(n+1) > a(n) is chosen.A087583
Distinct primes such that the absolute values of successive differences are distinct palindromes. a(n+1) is chosen to be < a(n) if such a prime exists, minimizing a(n)-a(n+1); otherwise the minimal a(n+1) > a(n) is chosen.
- a(n) = (1/7)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*7^k.A087584
a(n) = (1/7)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*7^k.
- a(1) = 12; a(n) = smallest multiple of a(n-1), not == 0 (mod 10) beginning with the digit reversal of a(n-1).A087585
a(1) = 12; a(n) = smallest multiple of a(n-1), not == 0 (mod 10) beginning with the digit reversal of a(n-1).
- a(1) = 1, a(n) = smallest square beginning with the digit reversal of a(n-1).A087586
a(1) = 1, a(n) = smallest square beginning with the digit reversal of a(n-1).
- a(n) = A087586(n)^(1/2).A087587
a(n) = A087586(n)^(1/2).
- a(1) = 4, a(n) = smallest square beginning with the digit reversal of a(n-1).A087588
a(1) = 4, a(n) = smallest square beginning with the digit reversal of a(n-1).
- a(n) = A087588(n)^(1/2).A087589
a(n) = A087588(n)^(1/2).
- a(1) = 9, a(n) = smallest square beginning with the digit reversal of a(n-1). a(n) > a(n-1) and a(n) is not == 0 (mod 10).A087590
a(1) = 9, a(n) = smallest square beginning with the digit reversal of a(n-1). a(n) > a(n-1) and a(n) is not == 0 (mod 10).
- a(n) = A087590(n)^(1/2).A087591
a(n) = A087590(n)^(1/2).
- Primes whose successive differences are increasing power of 2: a(1) = 2, a(n+1) = a(n) + 2^k; a(n+1) prime, k minimal and greater than the index for the previous term.A087592
Primes whose successive differences are increasing power of 2: a(1) = 2, a(n+1) = a(n) + 2^k; a(n+1) prime, k minimal and greater than the index for the previous term.
- Define dd(n) = the number formed by concatenating the absolute difference of successive digits. Sequence contains primes p such that dd(p) is also prime. (Primes in which the number formed by successive digit difference is also a prime.).A087593
Define dd(n) = the number formed by concatenating the absolute difference of successive digits. Sequence contains primes p such that dd(p) is also prime. (Primes in which the number formed by successive digit difference is also a prime.).
- Define dd(n) = the number formed by concatenating the absolute difference of successive digits. Sequence contains primes p such that dd(p)=q is a prime, dd(q) is also a prime = r and so on until a single-digit prime (2,3,5,7) arises. (Primes in which the number formed by successive digit differences are primes at every step until a single-digit prime is obtained.).A087594
Define dd(n) = the number formed by concatenating the absolute difference of successive digits. Sequence contains primes p such that dd(p)=q is a prime, dd(q) is also a prime = r and so on until a single-digit prime (2,3,5,7) arises. (Primes in which the number formed by successive digit differences are primes at every step until a single-digit prime is obtained.).
- Smallest n-digit member of A087593. Define dd(k) = the number formed by concatenating the absolute difference of successive digits of k. Sequence contains smallest n-digit prime p such that dd(p) is also prime.A087595
Smallest n-digit member of A087593. Define dd(k) = the number formed by concatenating the absolute difference of successive digits of k. Sequence contains smallest n-digit prime p such that dd(p) is also prime.
- Largest n-digit member of A087593. Define dd(k) = the number formed by concatenating the absolute difference of successive digits of k. Sequence contains largest n-digit prime p such that dd(p) is also prime.A087596
Largest n-digit member of A087593. Define dd(k) = the number formed by concatenating the absolute difference of successive digits of k. Sequence contains largest n-digit prime p such that dd(p) is also prime.
- Triangular numbers m such that A040115(m) is also triangular.A087597
Triangular numbers m such that A040115(m) is also triangular.
- Numbers m such that all terms in the sequence m, A040115(m), A040115(A040115(m)), ..., 0 are triangular numbers (A000217).A087598
Numbers m such that all terms in the sequence m, A040115(m), A040115(A040115(m)), ..., 0 are triangular numbers (A000217).
- Smallest nonzero n-digit term of A087597, or 0 if no such number exists.A087599
Smallest nonzero n-digit term of A087597, or 0 if no such number exists.
- Largest n-digit term of A087597, or 0 if no such number exists.A087600
Largest n-digit term of A087597, or 0 if no such number exists.
- Primes occurring as lesser side of Heronian triangle (sides are consecutive integers, area and inradius are integers).A087601
Primes occurring as lesser side of Heronian triangle (sides are consecutive integers, area and inradius are integers).
- Primes occurring as larger side of Heronian triangle (sides are consecutive integers, area and inradius are integers).A087602
Primes occurring as larger side of Heronian triangle (sides are consecutive integers, area and inradius are integers).
- a(n) = (1/8)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*8^k.A087603
a(n) = (1/8)*Sum_{k=0..n} binomial(n,k)*Fibonacci(k)*8^k.
- Smallest k such that n times concatenation of k with itself followed by a 3 is a prime, or 0 if no such number exists.A087604
Smallest k such that n times concatenation of k with itself followed by a 3 is a prime, or 0 if no such number exists.
- Smallest k such that n times concatenation of k with itself followed by a 7 is a prime, or 0 if no such number exists.A087605
Smallest k such that n times concatenation of k with itself followed by a 7 is a prime, or 0 if no such number exists.
- Smallest k such that n times concatenation of k with itself followed by a 9 is a prime, or 0 if no such number exists.A087606
Smallest k such that n times concatenation of k with itself followed by a 9 is a prime, or 0 if no such number exists.
- Primes arising in A087606, or 0 if A087606(k) = 0.A087607
Primes arising in A087606, or 0 if A087606(k) = 0.
- Primes arising in A087605, or 0 if A087605(n) = 0.A087608
Primes arising in A087605, or 0 if A087605(n) = 0.
- Primes arising in A087604, or 0 if A087604(n) = 0.A087609
Primes arising in A087604, or 0 if A087604(n) = 0.
- Number of (-1,0,1) polynomials of degree-n irreducible over the integers.A087610
Number of (-1,0,1) polynomials of degree-n irreducible over the integers.