Sequences
392,541 sequences
- Primes arising in A090510.A090511
Primes arising in A090510.
- Least multiple of n such that the n-th concatenation is a multiple of n. The (previous) (n-1)-th term is so chosen that the n-th term exists.A090512
Least multiple of n such that the n-th concatenation is a multiple of n. The (previous) (n-1)-th term is so chosen that the n-th term exists.
- Least m exceeding the previous term such that the concatenation mnm is prime.A090513
Least m exceeding the previous term such that the concatenation mnm is prime.
- Primes arising in A090513.A090514
Primes arising in A090513.
- Duplicate of A075309.A090515
Duplicate of A075309.
- Perfect powers (at least a square) in which neighboring digits are distinct.A090516
Perfect powers (at least a square) in which neighboring digits are distinct.
- Least k such that floor[(10^n)/k] is prime.A090517
Least k such that floor[(10^n)/k] is prime.
- Primes arising in A090517, or 0 if A090517(n) = 0.A090518
Primes arising in A090517, or 0 if A090517(n) = 0.
- Smallest prime p such that floor((10^n)/p) is prime, or 0 if no such number exists.A090519
Smallest prime p such that floor((10^n)/p) is prime, or 0 if no such number exists.
- Primes arising in A090519, or 0 if A090519(n)= 0.A090520
Primes arising in A090519, or 0 if A090519(n)= 0.
- Least k such that floor[n!/k] is prime.A090521
Least k such that floor[n!/k] is prime.
- Largest prime of the form floor(n!/k). Primes arising in A090521.A090522
Largest prime of the form floor(n!/k). Primes arising in A090521.
- Smallest prime p such that floor(n!/p) is prime, or 0 if no such prime exists.A090523
Smallest prime p such that floor(n!/p) is prime, or 0 if no such prime exists.
- Primes arising in A090523, or 0 if no such prime exists.A090524
Primes arising in A090523, or 0 if no such prime exists.
- Least number k such that floor((n^n)/k) is prime, or 0 if no such number exists.A090525
Least number k such that floor((n^n)/k) is prime, or 0 if no such number exists.
- Primes arising in A090525, or 0 if A090525(n) = 0.A090526
Primes arising in A090525, or 0 if A090525(n) = 0.
- Smallest prime p such that floor((n^n)/p) is prime, or 0 if no such number exists.A090527
Smallest prime p such that floor((n^n)/p) is prime, or 0 if no such number exists.
- Primes arising in A090527.A090528
Primes arising in A090527.
- a(n) is the smallest positive m such that n <= m!.A090529
a(n) is the smallest positive m such that n <= m!.
- Least multiple k of prime(n) such that (k-1,k+1) forms a twin prime pair, or 0 if no such number exists.A090530
Least multiple k of prime(n) such that (k-1,k+1) forms a twin prime pair, or 0 if no such number exists.
- Least multiple of n! sandwiched between twin primes, or 0 if no such number exists.A090531
Least multiple of n! sandwiched between twin primes, or 0 if no such number exists.
- Let f(n) = n - pi(n) = A062298(n). Then a(n) = least number of steps such that f(f(...(n))) = 1.A090532
Let f(n) = n - pi(n) = A062298(n). Then a(n) = least number of steps such that f(f(...(n))) = 1.
- Duplicate of A025003.A090533
Duplicate of A025003.
- Least n-digit prime in which every two-digit string is also a prime, or 0 if no such number exists. (n-1 two-digit string primes occur.)A090534
Least n-digit prime in which every two-digit string is also a prime, or 0 if no such number exists. (n-1 two-digit string primes occur.)
- Least n-digit prime using digit 7 once and rest all 1, or 0 if no such prime exists.A090535
Least n-digit prime using digit 7 once and rest all 1, or 0 if no such prime exists.
- Location of 7 in A090535, or 0 if A090535 is 0.A090536
Location of 7 in A090535, or 0 if A090535 is 0.
- Least n-digit prime using digit 3 once and rest all 1, or 0 if no such prime exists.A090537
Least n-digit prime using digit 3 once and rest all 1, or 0 if no such prime exists.
- Location of 3 in A090537, or 0 if A090537 is 0.A090538
Location of 3 in A090537, or 0 if A090537 is 0.
- Total number of parts equal to 1 in all plane partitions of n.A090539
Total number of parts equal to 1 in all plane partitions of n.
- Beginning with 3, least prime obtained by sandwiching the previous term between strings of identical digits.A090540
Beginning with 3, least prime obtained by sandwiching the previous term between strings of identical digits.
- a(n) = floor((Sum_{r=1..n} r)*(Sum_{r=1..n} 1/r)).A090541
a(n) = floor((Sum_{r=1..n} r)*(Sum_{r=1..n} 1/r)).
- Incorrect version of A060462.A090542
Incorrect version of A060462.
- a(1) = 3, then a(n) = least prime, not already present, beginning with the digit reversal of a(n-1).A090543
a(1) = 3, then a(n) = least prime, not already present, beginning with the digit reversal of a(n-1).
- Let f(k) = k + pi(k); a(n) = least number of steps for f(f(f(...(n)))) to reach a prime.A090544
Let f(k) = k + pi(k); a(n) = least number of steps for f(f(f(...(n)))) to reach a prime.
- Primes arising in A090544.A090545
Primes arising in A090544.
- Position of first occurrence of n in A090544.A090546
Position of first occurrence of n in A090544.
- Leading entries in triangle in A090548 and A113470.A090547
Leading entries in triangle in A090548 and A113470.
- Least number that ends an arithmetic progression of n numbers with the same number of divisors.A090548
Least number that ends an arithmetic progression of n numbers with the same number of divisors.
- Common difference of arithmetic progression in n-th row of A090548 and A113470.A090549
Common difference of arithmetic progression in n-th row of A090548 and A113470.
- Decimal expansion of solution to n/x = x - n for n = 5.A090550
Decimal expansion of solution to n/x = x - n for n = 5.
- Decimal expansion of sqrt(3) - Pi/2.A090551
Decimal expansion of sqrt(3) - Pi/2.
- a(1)=1; for n>1, a(n) is the smallest positive integer for which sigma(a(n)) is a multiple of sigma(a(n-1)).A090552
a(1)=1; for n>1, a(n) is the smallest positive integer for which sigma(a(n)) is a multiple of sigma(a(n-1)).
- Sigma(A090552(n)).A090553
Sigma(A090552(n)).
- Erroneous version of A007368.A090554
Erroneous version of A007368.
- Erroneous version of A014573.A090555
Erroneous version of A014573.
- Beginning with 1, a(n) = least number m > a(n-1) such that phi(a(n-1)) divides phi(m).A090556
Beginning with 1, a(n) = least number m > a(n-1) such that phi(a(n-1)) divides phi(m).
- a(n) = phi(A090556(n)).A090557
a(n) = phi(A090556(n)).
- Duplicate of A068704.A090558
Duplicate of A068704.
- Beginning with 2, least number such that concatenation of r copies of a(r), r = 1 to n is prime.A090559
Beginning with 2, least number such that concatenation of r copies of a(r), r = 1 to n is prime.
- Primes arising in A090559.A090560
Primes arising in A090559.