Sequences
392,541 sequences
- a(1) = 2; for n>1, a(n) = smallest number == 1 (mod a(n-1)) with a prime signature of n.A087311
a(1) = 2; for n>1, a(n) = smallest number == 1 (mod a(n-1)) with a prime signature of n.
- a(1) = 1; for n > 1, a(n) is the smallest number == -1 (mod a(n-1)), greater than n, with the same prime signature as n.A087312
a(1) = 1; for n > 1, a(n) is the smallest number == -1 (mod a(n-1)), greater than n, with the same prime signature as n.
- a(n) is the smallest integer > 1 of the form sum_{i = 1..n} x^(1/i)/n.A087313
a(n) is the smallest integer > 1 of the form sum_{i = 1..n} x^(1/i)/n.
- a(n) = (1/n) * Sum_{k = 0..n} n^binomial(n,k).A087314
a(n) = (1/n) * Sum_{k = 0..n} n^binomial(n,k).
- a(n) = Product_{k=1..n} prime(k)^prime(n-k+1).A087315
a(n) = Product_{k=1..n} prime(k)^prime(n-k+1).
- a(n) = Sum_{k=1..n} prime(k)^prime(n-k+1).A087316
a(n) = Sum_{k=1..n} prime(k)^prime(n-k+1).
- Duplicate of A086489.A087317
Duplicate of A086489.
- Smallest number of the form n^k +1 with the prime signature of n, or 0 if no such number exists.A087318
Smallest number of the form n^k +1 with the prime signature of n, or 0 if no such number exists.
- Smallest number of the form n^k +1, with tau(a(n)) = tau(n), or 0 if no such number exists.A087319
Smallest number of the form n^k +1, with tau(a(n)) = tau(n), or 0 if no such number exists.
- Smallest perfect power (at least a square) that is a multiple of n.A087320
Smallest perfect power (at least a square) that is a multiple of n.
- Smallest multiple of n which is a perfect power (at least a square) of a squarefree number.A087321
Smallest multiple of n which is a perfect power (at least a square) of a squarefree number.
- Triangle T read by rows: T(n, 1) = 2*n + 1. For 1 < k <= n, T(n, k) = 2*T(n,k-1) + 1.A087322
Triangle T read by rows: T(n, 1) = 2*n + 1. For 1 < k <= n, T(n, k) = 2*T(n,k-1) + 1.
- a(n) = (n+1) * 2^n - 1.A087323
a(n) = (n+1) * 2^n - 1.
- Numbers n such that n and its 9's complement both have the same prime signature.A087324
Numbers n such that n and its 9's complement both have the same prime signature.
- Numbers k such that k and its 10's complement both have the same prime signature.A087325
Numbers k such that k and its 10's complement both have the same prime signature.
- Erroneous version of A075031.A087326
Erroneous version of A075031.
- Independence numbers for KT_2 knight on triangular board.A087327
Independence numbers for KT_2 knight on triangular board.
- Independence numbers for KT_3 knight on hexagonal board.A087328
Independence numbers for KT_3 knight on hexagonal board.
- Independence numbers for KT_4 knight on hexagonal board.A087329
Independence numbers for KT_4 knight on hexagonal board.
- Sum of all digits of all integers less than or equal to 555...55 (with n 5's) in base 10.A087330
Sum of all digits of all integers less than or equal to 555...55 (with n 5's) in base 10.
- Smallest number with all identical digits having n distinct prime divisors.A087331
Smallest number with all identical digits having n distinct prime divisors.
- Smallest prime which is a concatenation of n successive even numbers with only the least significant digit odd.A087332
Smallest prime which is a concatenation of n successive even numbers with only the least significant digit odd.
- Smallest prime which begins with the concatenation of n successive odd numbers.A087333
Smallest prime which begins with the concatenation of n successive odd numbers.
- a(1) = 3, then smallest number such that every partial product + 1 is a distinct square.A087334
a(1) = 3, then smallest number such that every partial product + 1 is a distinct square.
- Squares pertaining to A087334: a(n) = n-th partial product of A087334 + 1.A087335
Squares pertaining to A087334: a(n) = n-th partial product of A087334 + 1.
- a(1) = 7, then smallest number such that every partial product + 1 is a cube.A087336
a(1) = 7, then smallest number such that every partial product + 1 is a cube.
- Cubes pertaining to A087336. a(n) = n-th partial product of A087336 + 1.A087337
Cubes pertaining to A087336. a(n) = n-th partial product of A087336 + 1.
- a(1) = 1, then the smallest number > 1 such that both every partial sum and every partial product + 1 are prime for n > 1.A087338
a(1) = 1, then the smallest number > 1 such that both every partial sum and every partial product + 1 are prime for n > 1.
- Numbers k such that both the sum of the digits of k and 1 plus the product of its digits are primes.A087339
Numbers k such that both the sum of the digits of k and 1 plus the product of its digits are primes.
- Primes p such that the sum of the digits of p as well as 1 plus the product of its digits are also primes.A087340
Primes p such that the sum of the digits of p as well as 1 plus the product of its digits are also primes.
- Smallest prime which is a concatenation of n successive composite numbers.A087341
Smallest prime which is a concatenation of n successive composite numbers.
- Smallest multiple of n which is the concatenation of n successive numbers in descending order, or 0 if no such number exists.A087342
Smallest multiple of n which is the concatenation of n successive numbers in descending order, or 0 if no such number exists.
- Smallest k such that the concatenation of the n numbers k, k-1, k-2, k-3,... k-n+1 (the concatenation of n successive numbers in descending order) is divisible by n, or 0 if no such number exists.A087343
Smallest k such that the concatenation of the n numbers k, k-1, k-2, k-3,... k-n+1 (the concatenation of n successive numbers in descending order) is divisible by n, or 0 if no such number exists.
- Smallest prime formed by concatenating n consecutive Fibonacci numbers.A087344
Smallest prime formed by concatenating n consecutive Fibonacci numbers.
- Smallest prime which is a concatenation of n successive triangular numbers, or 0 if no such number exists.A087345
Smallest prime which is a concatenation of n successive triangular numbers, or 0 if no such number exists.
- a(n) = A088116(100+n).A087346
a(n) = A088116(100+n).
- Numbers k that divide Sum_{j=1..k} Fibonacci(j*k).A087347
Numbers k that divide Sum_{j=1..k} Fibonacci(j*k).
- a(n) = 10*n^2 - 6*n + 1.A087348
a(n) = 10*n^2 - 6*n + 1.
- a(n) = n + (smallest prime-factor of n+1).A087349
a(n) = n + (smallest prime-factor of n+1).
- a(n) = Sum_{k=0..n} (3*n)!/(3*k)!.A087350
a(n) = Sum_{k=0..n} (3*n)!/(3*k)!.
- Smallest noncomposite number which is the concatenation of n successive squares, or 0 if no such number exists.A087351
Smallest noncomposite number which is the concatenation of n successive squares, or 0 if no such number exists.
- a(n+1) is the smallest square > a(n) such that every concatenation (n > 1) is a prime.A087352
a(n+1) is the smallest square > a(n) such that every concatenation (n > 1) is a prime.
- Primes arising in A087352.A087353
Primes arising in A087352.
- Smallest square which is the concatenation of n nonzero squares.A087354
Smallest square which is the concatenation of n nonzero squares.
- n^10 mod 10^n.A087355
n^10 mod 10^n.
- Beginning with 2, smallest primes such that a(k)-a(k-1) is a distinct power of 2.A087356
Beginning with 2, smallest primes such that a(k)-a(k-1) is a distinct power of 2.
- Index of powers of 2 arising as the difference of a pair of successive terms of A087356.A087357
Index of powers of 2 arising as the difference of a pair of successive terms of A087356.
- a(n+1) is the smallest prime > a(n) such that a(n+1) - a(n) == 0 (mod n^n).A087358
a(n+1) is the smallest prime > a(n) such that a(n+1) - a(n) == 0 (mod n^n).
- For n > 2, a(n) is the smallest triangular number > a(n-1) and congruent to a(n-1) (mod a(n-2)).A087359
For n > 2, a(n) is the smallest triangular number > a(n-1) and congruent to a(n-1) (mod a(n-2)).
- Indices of triangular numbers in A087359.A087360
Indices of triangular numbers in A087359.