Sequences
392,541 sequences
- For n > 2, a(n) = smallest square > a(n-1) and congruent to a(n-1) (mod a(n-2)).A087361
For n > 2, a(n) = smallest square > a(n-1) and congruent to a(n-1) (mod a(n-2)).
- a(n) = A087361(n)^(1/2).A087362
a(n) = A087361(n)^(1/2).
- Primes having only {3, 5, 7} as digits.A087363
Primes having only {3, 5, 7} as digits.
- Smallest palindromic prime built using the palindromes with odd number of digits as central digits.A087364
Smallest palindromic prime built using the palindromes with odd number of digits as central digits.
- Smallest palindrome divisible by n^n, or 0 if none exists.A087365
Smallest palindrome divisible by n^n, or 0 if none exists.
- Smallest k such that k*n^n is a palindrome, or 0 if none exists.A087366
Smallest k such that k*n^n is a palindrome, or 0 if none exists.
- Twin primes whose digits are primes.A087367
Twin primes whose digits are primes.
- Prime-indexed primes (PIPs) whose digits are all primes.A087368
Prime-indexed primes (PIPs) whose digits are all primes.
- Smallest palindromic square multiple of the n-th palindrome.A087369
Smallest palindromic square multiple of the n-th palindrome.
- Numbers n such that 3n - 1 is a prime.A087370
Numbers n such that 3n - 1 is a prime.
- Smallest k such that 10^k + 2n-1 is a prime >10, or 0 if no such k exists. Index of the smallest power of 10 which when increased by the n-th odd number yields a prime.A087371
Smallest k such that 10^k + 2n-1 is a prime >10, or 0 if no such k exists. Index of the smallest power of 10 which when increased by the n-th odd number yields a prime.
- Smallest k such that 3^k + 2n is a prime, or 0 if no such k exists. Index of the smallest power of 3 which when increased by the n-th even number yields a prime.A087372
Smallest k such that 3^k + 2n is a prime, or 0 if no such k exists. Index of the smallest power of 3 which when increased by the n-th even number yields a prime.
- Twin-prime-indexed primes (TWIPS): members of a pair of twin primes whose prime index is also a member of a pair of twin primes.A087373
Twin-prime-indexed primes (TWIPS): members of a pair of twin primes whose prime index is also a member of a pair of twin primes.
- Smallest square >= n!.A087374
Smallest square >= n!.
- Smallest n-th power > n!.A087375
Smallest n-th power > n!.
- Leading diagonal of A087377.A087376
Leading diagonal of A087377.
- Triangle read by rows: n-th row contains n smallest numbers k (say) such that nk+1 is a prime.A087377
Triangle read by rows: n-th row contains n smallest numbers k (say) such that nk+1 is a prime.
- Smallest k such that both k-n and k+n are primes and there are no primes between them.A087378
Smallest k such that both k-n and k+n are primes and there are no primes between them.
- Beginning with 2, primes such that the difference between two successive terms is a distinct composite number.A087379
Beginning with 2, primes such that the difference between two successive terms is a distinct composite number.
- Let Pricom(n) be defined as the number obtained by replacing each prime digit (2,3,5,7) of n with a '0' and a composite digit (0,4,6,8,9) with a '1' . A 1 remains the same. a(n) = Pricom(n).A087380
Let Pricom(n) be defined as the number obtained by replacing each prime digit (2,3,5,7) of n with a '0' and a composite digit (0,4,6,8,9) with a '1' . A 1 remains the same. a(n) = Pricom(n).
- Let Compri(n) be the number obtained by replacing each prime digit (2,3,5,7) of n with a '1' and a composite digit( 0,4,6,8,9) with a '0'. A 1 remains the same. a(n) = Compri(n).A087381
Let Compri(n) be the number obtained by replacing each prime digit (2,3,5,7) of n with a '1' and a composite digit( 0,4,6,8,9) with a '0'. A 1 remains the same. a(n) = Compri(n).
- Twin prime indices of primes forming a twin prime member.A087382
Twin prime indices of primes forming a twin prime member.
- Primes p such that p is a twin prime and prime(prime(p)) is also a twin prime.A087383
Primes p such that p is a twin prime and prime(prime(p)) is also a twin prime.
- a(n) is the smallest prime == 1 (mod F(n)) where F(n) is the n-th Fibonacci number.A087384
a(n) is the smallest prime == 1 (mod F(n)) where F(n) is the n-th Fibonacci number.
- a(n) = smallest prime == 1 (mod T(n)) where T(n) is the n-th triangular number (A000217).A087385
a(n) = smallest prime == 1 (mod T(n)) where T(n) is the n-th triangular number (A000217).
- a(n) = smallest prime == 1 (mod P(n)) where P(n) is the n-th Palindrome.A087386
a(n) = smallest prime == 1 (mod P(n)) where P(n) is the n-th Palindrome.
- Palindromes in A087386.A087387
Palindromes in A087386.
- a(1) = 2; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).A087388
a(1) = 2; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).
- a(1) = 3; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).A087389
a(1) = 3; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).
- a(1) = 7; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).A087390
a(1) = 7; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).
- a(1) = 11; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).A087391
a(1) = 11; a(n+1) is the least prime formed by adding one or more digits to the digit reversal of a(n).
- a(1) = 1, a(n) = smallest multiple of n beginning with the digit reversal of a(n-1).A087392
a(1) = 1, a(n) = smallest multiple of n beginning with the digit reversal of a(n-1).
- a(1) = 1, a(n) = smallest number beginning with a(n-1) == 0 (mod n!).A087393
a(1) = 1, a(n) = smallest number beginning with a(n-1) == 0 (mod n!).
- Prime(prime(n)) when prime(prime(n)) and n are twin primes.A087394
Prime(prime(n)) when prime(prime(n)) and n are twin primes.
- Primes in which the frequency of every digit is the same and is at least 2.A087395
Primes in which the frequency of every digit is the same and is at least 2.
- Smallest nontrivial multiple of n with each digit occurring with the same frequency >1. By nontrivial we mean a(n) is not a concatenation of n with itself.A087396
Smallest nontrivial multiple of n with each digit occurring with the same frequency >1. By nontrivial we mean a(n) is not a concatenation of n with itself.
- Smallest triangular number > 1 and == 1 (mod prime(n)).A087397
Smallest triangular number > 1 and == 1 (mod prime(n)).
- Primes of the form primorial(P(k))/2-2.A087398
Primes of the form primorial(P(k))/2-2.
- Duplicate of A085692.A087399
Duplicate of A085692.
- Primes p such that p+2 is a piptorial number. Also numbers such that A080696(n)- 2 is prime.A087400
Primes p such that p+2 is a piptorial number. Also numbers such that A080696(n)- 2 is prime.
- Triangle of n*r-binomial(r+1,2).A087401
Triangle of n*r-binomial(r+1,2).
- a(n) is the smallest repdigit > 10 such that Sum_{i=0..n} a(i) is prime.A087402
a(n) is the smallest repdigit > 10 such that Sum_{i=0..n} a(i) is prime.
- a(n) = smallest prime of the form 10*K(n) + 1, where K is a number obtained by concatenation of n with itself, or 0 if no such prime exists.A087403
a(n) = smallest prime of the form 10*K(n) + 1, where K is a number obtained by concatenation of n with itself, or 0 if no such prime exists.
- a(n) = 4*a(n-1) + 5*a(n-2) for n > 1, with a(0) = 2 and a(1) = 4.A087404
a(n) = 4*a(n-1) + 5*a(n-2) for n > 1, with a(0) = 2 and a(1) = 4.
- First differences of A087404: a(n) = A087404(n) - A087404(n-1), a(0) = A087404(0).A087405
First differences of A087404: a(n) = A087404(n) - A087404(n-1), a(0) = A087404(0).
- Multiples of 2 with digits grouped in pairs and leading zeros omitted.A087406
Multiples of 2 with digits grouped in pairs and leading zeros omitted.
- Multiples of 4 with digits grouped in pairs and leading zeros omitted.A087407
Multiples of 4 with digits grouped in pairs and leading zeros omitted.
- Multiples of 5 with digits grouped in pairs and leading zeros omitted.A087408
Multiples of 5 with digits grouped in pairs and leading zeros omitted.
- Multiples of 6 with digits grouped in pairs and leading zeros omitted.A087409
Multiples of 6 with digits grouped in pairs and leading zeros omitted.
- Multiples of 8 with digits grouped in pairs and leading zeros omitted.A087410
Multiples of 8 with digits grouped in pairs and leading zeros omitted.